Counterattack

Counterattacks are a crucial tactic in soccer. When WeissBlume FC defends, everyone except two strikers stays back in their own half. The instant a defender wins the ball, they launch a long pass to one of the two strikers and the counterattack begins.

Both strikers run along fixed, synchronized routes. Each route has the same $n$ marked points numbered $1$ through $n$, and at every step both strikers stand at their own point of the same index. Whenever the striker in possession is at point $i$ with $i < n$, they must choose one of two moves:

• Dribble to their own point $i+1$.
• Pass to the other striker's point $i+1$.

At the last point $n$, the striker in possession shoots.

Each of the four possible actions (long pass, dribble, pass, shot) can fail, so the coach assigned every action a difficulty. One full counterattack is:

1. The defender's long pass, placing the ball on striker 1's point $1$ (difficulty $l_1$) or striker 2's point $1$ (difficulty $l_2$).
2. A sequence of dribbles and passes that advances the ball from point $i$ to point $i+1$ until it reaches point $n$.
3. A shot at point $n$, taken by striker 1 (difficulty $s_1$) or striker 2 (difficulty $s_2$).

Assuming WeissBlume FC plays ideally, compute the minimum possible total difficulty to score.

The first line contains the number of test cases $c$ ($1 \le c \le 100$). Each test case consists of five lines.

The first line of a test case contains $n$, $l_1$, $l_2$, $s_1$, $s_2$. Here $n$ ($2 \le n \le 100000$) is the number of marked points on each route, $l_1$ and $l_2$ are the difficulties of the defender's long pass to striker 1 and striker 2, and $s_1$ and $s_2$ are the difficulties of a shot by striker 1 and striker 2.

The second line contains $n-1$ integers; the $i$-th is the difficulty of striker 1 passing from their point $i$ to striker 2's point $i+1$.

The third line contains $n-1$ integers; the $i$-th is the difficulty of striker 1 dribbling from their point $i$ to their own point $i+1$.

The fourth line contains $n-1$ integers; the $i$-th is the difficulty of striker 2 passing from their point $i$ to striker 1's point $i+1$.

The fifth line contains $n-1$ integers; the $i$-th is the difficulty of striker 2 dribbling from their point $i$ to their own point $i+1$.

Every difficulty is a non-negative integer not greater than $1000$.

For each test case, print a single line containing the minimum total difficulty required to score.