Problem:
Score : 200 points

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.

Sample Input 1

3
3 1 2
2 5 4
3 6

Sample Output 1

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 Input 2

4
2 3 4 1
13 5 8 24
45 9 15

Sample Output 2

74

Sample Input 3

2
1 2
50 50
50

Sample Output 3

150

Solution in Java8 (OpenJDK 1.8.0) (judge verdict: Accepted)

import java.util.Scanner;

/**
 * B - Buffet
 * 料理は全部食べるので、満足度は最終的に全て足すことになる。
 *
 */
public class Main {

    public static void main(String[] args) {

        Scanner sc = new Scanner( System.in );
        // ビュッフェでの料理の種類数
        int n = sc.nextInt();
//        System.out.println( "n : " + n );

        // 食べた順番
        int[] a = new int[n];
//        int addCount = 0;
        for( int i = 0; i < n; i++ ) {
//            System.out.println( "i : " + i );
            a[i] = sc.nextInt();
//            System.out.println( "a[" + i + "]" + a[i] );
        }

        // 満足度
        int point = 0;
        int[] b = new int[n];
        for( int j = 0; j < n; j++ ) {
           b[j] = sc.nextInt();
           point += b[j];
//           System.out.println( "b[" + j + "]" + b[j] );
        }
//        System.out.println( "point! : " + point );

        // 追加満足度
        int[] c = new int[n - 1];
        for( int k = 0; k < ( n -1 ); k++ ) {
           c[k] = sc.nextInt();
//           System.out.println( "c[" + k + "]" + c[k] );
        }

        for( int l = 0; l < n; l++ ) {
//            System.out.println("l : " + l);
//            System.out.println("a[l] : " + a[l]);
//            int current = (a[l] + 1 );
//            System.out.println("a[l] - 1 : " + ( a[l] - 1 ));
//            point += b[( a[l] - 1 )];
//            System.out.println("compare : " +  (n > (l+1)));
//            System.out.println("compare2 : " +( ( a[l] + 1 ) == a[( l + 1 )] ));
//            System.out.println("compare3 : " +( a[l] + 1 ));
//            System.out.println("compare4 : " + a[( l + 1 )] );
            if(  ( l + 1 ) < n && ( a[l] + 1 ) == a[( l + 1 )] ) {
//                System.out.println( "c[( l + 1 )] : " + c[( l + 1 )] );
                point += c[a[l] - 1];
            }
//            System.out.println( "point : " + point );
        }
        System.out.println( point );
     }
}