There is a shop with (n) objects numbered from (1) to (n), and only one copy of each object. According to you, the objects have values (v_1, v_2, \ldots, v_n) (which can be negative). Alice and Bob have their own order of preference of objects ((a_1, a_2, \ldots, a_n) and (b_1, b_2, \ldots, b_n) respectively). In particular, Alice's favourite object is (a_1), followed by (a_2), etc.; Bob's favourite object is (b_1), followed by (b_2), etc. For (n) times, one of them goes to the shop and buys her or his most favourite object still in the shop. At the end, Alice and Bob have their own sets of objects. Now the shop is empty, and you wonder whether Alice's preferences are similar to yours. Over all sets of objects that Alice could have bought, what's the maximum sum of values according to you? Each test contains multiple test cases. The first line contains the number of test cases (t) ((1 \le t \le 10^4)). The description of the test cases follows. The first line of each test case contains a single integer (n) ((1 \le n \le 2 \cdot 10^5)) — the number of objects. The second line of each test case contains (n) integers (v_1, v_2, \ldots, v_n) ((-10^9 \le v_i \le 10^9)) — the values of the objects, according to you. The third line of each test case contains (n) integers (a_1, a_2, \ldots, a_n) ((1 \le a_i \le n)) — Alice's order of preference. The (a_i) are distinct. The fourth line of each test case contains (n) integers (b_1, b_2, \ldots, b_n) ((1 \le b_i \le n)) — Bob's order of preference. The (b_i) are distinct. It is guaranteed that the sum of (n) over all test cases does not exceed (2 \cdot 10^5). For each test case, output a single integer: the maximum sum of values over all sets of objects that Alice could have bought. In the first test case, Alice can buy the sets of objects ([]) (empty), (1), (3), (3, 1), $$$3, 1, 2$$