Problem Statement

There is a war going on between N heroes. Each hero has some strength a[i] (1 ≤  i  ≤ N). You are also given an array b[i] which indicates the age of i^th hero.  Moreover, each hero has some coins associated with them, initially, all of them have coins equal to their strength. As the older ones are more experienced, younger ones can’t beat them even if their strength is greater than the older ones. A hero can kill his opponent if strength of opponent is not greater than hero's strength and age of hero is greater than the opponent.

For example :- In a battle between 2 heroes X and Y, having strengths a[x] and a[y]  respectively and their ages are b[x] and b[y] respectively, hero X can kill hero Y if a[x] $\geq$ a[y] and b[x] > b[y] and vice versa. However, in any other case, it will be considered as a draw.

Whenever a hero kills the other, he will take all the coins which his opponent had.

For example:- if hero X having 5 coins kills the hero Y having 10 coins then hero Y  will be eliminated and X takes all the coins he had. So, the total number of coins that X has after the battle is 15.

You have to find out the maximum number of coins any of the heroes can have without violating any of the above conditions.

Note:- A battle between 2 heroes doesn’t change the initial strength of the heroes (it will remain constant throughout the war). The only thing which can change after the battle is the number of coins.

Input:-

The first line contains a single integer t (1 ≤ t ≤ 100) -- the number of test cases.
The first line of each test case contains an integer N (1 ≤ N ≤ 10⁵) -- the number of heroes.
The second line of each test case contains N integers a₁,a₂,….. a_n (1 ≤  a_i  ≤ 10⁹) -- the strength of i^th hero.
The third line of each test case contains N distinct integers b₁,b₂,…..b_n(1  ≤  b_i ≤  N)-- the age of i^th hero.

Output:-

For each test case, print an integer that indicates the maximum number of coins a hero can have.