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) {
        // Return the maximum number of people that will be in a sunny town after removing exactly one cloud.
        Arrays.sort(p);
        int pl=p.length;
        int xl=x.length;
        int yl=y.length;
        int rl=r.length;
        long rvar=0l;
        House[] harr=new House[pl];
        int harri=0;
        for(int i=0;i<pl;i++){
            House h=new House(p[i],x[i]);
            harr[harri]=h;
            harri++;
        }
        ArrayList<Long> covered=new ArrayList<Long>();
        for(int i=0;i<yl;i++){
            covered.add(y[i]-r[i]);
            covered.add(y[i]+r[i]);
        }
        Arrays.sort(harr,new HComparator());
        for(House a:harr){
            //System.out.print(a.pop+" ");
            if(covered.contains(a.loc))
                rvar+=a.pop;
            else{
                rvar+=a.pop;
            }
            
        }
        //int town_popu=p[pl];
        
        return rvar;
    }

    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();
    }
}
class House{
    long pop;
    long loc;
    House(long p,long l){
        pop=p;
        loc=l;
    }
}
class HComparator implements Comparator<House>{
        public int compare(House e1, House e2) {
            return (int)e2.pop - (int)e1.pop;
        }
}