import java.util.Scanner;

public class Main {

    void solve() {
        Scanner sc = new Scanner(System.in);
        int N = sc.nextInt();
        int[] A = new int[N + 1];
        int[] B = new int[N + 1];
        int[] C = new int[N + 1];
        for (int i = 1; i <= N; i++) {
            A[i] = sc.nextInt();
        }
        for (int i = 1; i <= N; i++) {
            B[i] = sc.nextInt();
        }
        for (int i = 1; i <= N - 1; i++) {
            C[i] = sc.nextInt();
        }

        int sum = 0;
        int prevIndex = 0;
        for (int i = 1; i <= N; i++) {
            int currentIndex = A[i];
            sum += B[currentIndex];
            if (currentIndex == (prevIndex + 1)) {
                sum += C[prevIndex];
            }
            prevIndex = currentIndex;
        }
        System.out.print(sum);
    }

    // Main
    public static void main(String[] args) {
        new Main().solve();
    }
}
/tmp/hf-datasets-cache/medium/datasets/42704881117311-config-parquet-and-info-qiankunmu-Project_CodeNet-896c9d36/hub/datasets--qiankunmu--Project_CodeNet_Python800_and_Java250/snapshots/c899fde44a77ba1cc14973ed3de064e4ff3aadc7/Project_CodeNet_Java250.tar.gz