10762: ABC140 - B - Buffet
[Creator : ]
Description
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.
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.
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}$
```
```
$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.
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$
- $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$
Sample 1 Input
3
3 1 2
2 5 4
3 6
Sample 1 Output
14
Takahashi gained $14$ satisfaction points in total, as follows:
- First, he ate Dish $3$ and gained $4$ satisfaction points.
- Next, he ate Dish $1$ and gained $2$ satisfaction points.
- Lastly, he ate Dish $2$ and gained $5 + 3 = 8$ satisfaction points.
Sample 2 Input
4
2 3 4 1
13 5 8 24
45 9 15
Sample 2 Output
74
Sample 3 Input
2
1 2
50 50
50
Sample 3 Output
150