import java.io.*;
import java.util.*;
import java.text.*;
import java.math.*;
import java.util.regex.*;

public class Solution {

    	 static long maximumPeople(long[] p, long[] x, long[] y, long[] r) {
		 List<Integer> sunny = new ArrayList<>();
		 List<Integer> dark = new ArrayList<>();
		 long maxPop =0;
		 	for (int i = 0; i < x.length; i++) {
				for (int j = 0; j < y.length; j++) {
					if(x[i]-1 != y[j] && x[i] != y[j] && x[i]+1 != y[j] && x[i] != y[j]-1 && x[i] != y[j]+1){
						sunny.add(i);
						maxPop += p[i];
					}else{
						dark.add(i);
					}
				}
			}
		 	int maxDark = 0;
		 	for (int i = 0; i < dark.size(); i++) {
				if(p[(int) dark.get(i)]>maxDark)
					maxDark = (int) p[(int) dark.get(i)];
			}
	        return maxPop+maxDark;
	 }

    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        int n = in.nextInt();
        long[] p = new long[n];
        for(int p_i = 0; p_i < n; p_i++){
            p[p_i] = in.nextLong();
        }
        long[] x = new long[n];
        for(int x_i = 0; x_i < n; x_i++){
            x[x_i] = in.nextLong();
        }
        int m = in.nextInt();
        long[] y = new long[m];
        for(int y_i = 0; y_i < m; y_i++){
            y[y_i] = in.nextLong();
        }
        long[] r = new long[m];
        for(int r_i = 0; r_i < m; r_i++){
            r[r_i] = in.nextLong();
        }
        long result = maximumPeople(p, x, y, r);
        System.out.println(result);
        in.close();
    }
}