In a certain video game, the player controls a hero characterized by a single integer value: power.

On the current level, the hero got into a system of $n$ caves numbered from $1$ to $n$, and $m$ tunnels between them. Each tunnel connects two distinct caves. Any two caves are connected with at most one tunnel. Any cave can be reached from any other cave by moving via tunnels.

The hero starts the level in cave $1$, and every other cave contains a monster.

The hero can move between caves via tunnels. If the hero leaves a cave and enters a tunnel, he must finish his movement and arrive at the opposite end of the tunnel.

The hero can use each tunnel to move in both directions. However, the hero can not use the same tunnel twice in a row. Formally, if the hero has just moved from cave $i$ to cave $j$ via a tunnel, he can not head back to cave $i$ immediately after, but he can head to any other cave connected to cave $j$ with a tunnel.

It is known that at least two tunnels come out of every cave, thus, the hero will never find himself in a dead end even considering the above requirement.

To pass the level, the hero must beat the monsters in all the caves. When the hero enters a cave for the first time, he will have to fight the monster in it. The hero can beat the monster in cave $i$ if and only if the hero's power is strictly greater than $a_i$. In case of beating the monster, the hero's power increases by $b_i$. If the hero can't beat the monster he's fighting, the game ends and the player loses.

After the hero beats the monster in cave $i$, all subsequent visits to cave $i$ won't have any consequences: the cave won't have any monsters, and the hero's power won't change either.

Find the smallest possible power the hero must start the level with to be able to beat all the monsters and pass the level.

Each test contains multiple test cases. The first line contains the number of test cases $t$ ($1 \le t \le 100$). Description of the test cases follows.

The first line of each test case contains two integers $n$ and $m$ ($3 \le n \le 1000$; $n \le m \le min(\frac{n(n-1)}{2}, 2000)$) — the number of caves and tunnels.

The second line contains $n-1$ integers $a_2, a_3, \ldots, a_n$ ($1 \le a_i \le 10^9$) — values the hero's power are compared to while fighting monsters in caves $2, 3, \ldots, n$.

The third line contains $n-1$ integers $b_2, b_3, \ldots, b_n$ ($1 \le b_i \le 10^9$) — increases applied to the hero's power for beating monsters in caves $2, 3, \ldots, n$.

Each of the next $m$ lines contains two integers $u_i$ and $v_i$ ($1 \le u_i, v_i \le n$; $u_i \ne v_i$) — the numbers of caves connected with a tunnel.

No two caves are connected with more than one tunnel. Any cave can be reached from any other cave by moving via tunnels. At least two tunnels come out of every cave.

It is guaranteed that the sum of $n$ over all test cases does not exceed $1000$, and the sum of $m$ over all test cases does not exceed $2000$.

For each test case print a single integer — the smallest possible power the hero must start the level with to be able to beat all the monsters and pass the level.