Problem Statement

Takahashi went to an all-you-can-eat buffet with $N$ kinds of dishes and ate all of them (Dish $1$, Dish $2$, $\ldots$, Dish $N$) once.

The $i$-th dish $(1 \leq i \leq N)$ he ate was Dish $A_i$.

When he eats Dish $i$ $(1 \leq i \leq N)$, he gains $B_i$ satisfaction points.

Additionally, when he eats Dish $i+1$ just after eating Dish $i$ $(1 \leq i \leq N - 1)$, he gains $C_i$ more satisfaction points.

Find the sum of the satisfaction points he gained.

Constraints

• All values in input are integers.
• $2 \leq N \leq 20$
• $1 \leq A_i \leq N$
• $A_1, A_2, ..., A_N$ are all different.
• $1 \leq B_i \leq 50$
• $1 \leq C_i \leq 50$

Input

Input is given from Standard Input in the following format:

N
A_1 A_2 ... A_N
B_1 B_2 ... B_N
C_1 C_2 ... C_{N-1}

Output

Print the sum of the satisfaction points Takahashi gained, as an integer.