B. Death's Blessing

You are playing a computer game. To pass the current level, you have to kill a big horde of monsters. In this horde, there are $n$ monsters standing in the row, numbered from $1$ to $n$ . The $i$ -th monster has $a_{i}$ health and a special "Death's Blessing" spell of strength $b_{i}$ attached to it.

You are going to kill all of them one by one. It takes exactly $h$ seconds to kill a monster with health $h$ .

When the $i$ -th monster dies, it casts its spell that increases the health of its neighbors by $b_{i}$ (the neighbors of the $j$ -th monster in the row are the monsters on places $j - 1$ and $j + 1$ . The first and the last monsters have only one neighbor each).

After each monster is killed, the row shrinks, so its former neighbors become adjacent to each other (so if one of them dies, the other one is affected by its spell). For example, imagine a situation with $4$ monsters with health $a = [2, 6, 7, 3]$ and spells $b = [3, 6, 0, 5]$ . One of the ways to get rid of the monsters is shown below:

$2$	$6$	$7$	$3$	$\overset{6 s}{\to}$	$8$	$13$	$3$	$\overset{13 s}{\to}$	$8$	$3$	$\overset{8 s}{\to}$	$6$	$\overset{6 s}{\to}$	${}$
$3$	$6$	$0$	$5$	$\overset{6 s}{\to}$	$3$	$0$	$5$	$\overset{13 s}{\to}$	$3$	$5$	$\overset{8 s}{\to}$	$5$	$\overset{6 s}{\to}$	${}$

The first row represents the health of each monster, the second one — the power of the spells.

As a result, we can kill all monsters in $6 + 13 + 8 + 6$ $=$ $33$ seconds. Note that it's only an example and may not be the fastest way to get rid of the monsters.

What is the minimum time required to kill all monsters in the row?

Input

The first line contains a single integer $t$ ( $1 \leq t \leq 10^{4}$ ) — the number of test cases.

The first line of each test case contains a single integer $n$ ( $1 \leq n \leq 2 \cdot 10^{5}$ ) — the number of monsters in the row.

The second line contains $n$ integers $a_{1}, a_{2}, \dots, a_{n}$ ( $1 \leq a_{i} \leq 10^{9}$ ) — the initial health of corresponding monsters.

The third line contains $n$ integers $b_{1}, b_{2}, \dots, b_{n}$ ( $0 \leq b_{i} \leq 10^{9}$ ), where $b_{i}$ is the strength of the spell for the $i$ -th monster.

It's guaranteed that the sum of $n$ doesn't exceed $2 \cdot 10^{5}$ .

Output

For each test case, print one integer — the minimum possible total time to kill all monsters.

Example
inputCopy
4
1
10
0
3
100 1 100
1 100 1
4
2 6 7 3
3 6 0 5
2
1000000000 1000000000
1000000000 1000000000
outputCopy
10
203
26
3000000000

Note

In the first test case, there is only one monster that will be killed in $10$ seconds.

In the second test case, it's optimal to kill the first monster, the last monster and then the middle one. It will take $100 + 100 + (1 + 1 + 1)$ $=$ $203$ seconds.

In the third test case, it's optimal to kill the first monster, then the third one, then the fourth one and finally the second one. It will take $2 + 7 + (3 + 0) + (3 + 6 + 5)$ $=$ $26$ seconds.