import java.io.PrintWriter;
import java.util.Scanner;

public class Main {
	public static void main(String[] args) {
		Scanner scan = new Scanner(System.in);
		PrintWriter pw = new PrintWriter(System.out);
		
		int N = Integer.parseInt(scan.next());
		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) {
			int in = Integer.parseInt(scan.next());
			A[i] = in;
		}
		
		for(int i = 1; i <= N; ++i) {
			int in = Integer.parseInt(scan.next());
			B[i] = in;
		}
		
		for(int i = 1; i <= (N - 1); ++i) {
			int in = Integer.parseInt(scan.next());
			C[i] = in;
		}

		int sum = 0;
		
		for(int i = 1; i <= N; ++i) {
			sum += B[A[i]];
			
			if(i > 1 && A[i] == (A[i - 1] + 1)) {
				sum += C[A[i - 1]];
			}
		}
		
		pw.print(sum);
		
		scan.close();
		pw.close();
	}
}

/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