import java.util.*;
public class Main {

		static void solve() {
			Scanner sc = new Scanner(System.in);
			int n = sc.nextInt();
			int sum = 0;
			int[] dishes = new int[n];
			int[] bpoints = new int[n];
			int[] cpoints = new int [n-1];
			for(int i = 0;i<n;i++) {
				dishes[i] = sc.nextInt();
			}
			for(int i = 0;i<n;i++) {
				bpoints[i] = sc.nextInt();
			}
			for(int i = 0;i<n-1;i++) {
				cpoints[i] = sc.nextInt();
			}
			for(int i = 0;i<n;i++) {
				sum+=bpoints[dishes[i]-1];

			}
			for(int i = 1;i<n;i++) {
				if(dishes[i]-dishes[i-1]==1) {
					sum+=cpoints[dishes[i-1]-1];
				}
			}
			System.out.println(sum);
			sc.close();
		}
	public static void main(String[] args) {
		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