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) {
        HashMap<Long,Long> h=new HashMap<>();
        long sum=0;
        for(int i=0;i<x.length;i++)
        {
            h.put(x[i],p[i]);
            sum+=p[i];
        }
        long max=0l;
        for(int i=0;i<y.length;i++)
        {
            Long z=0l;
            for(long j=r[i]-y[i]<0?0:r[i]-y[i];j<=r[i]+y[i];j++)
                if(h.containsKey(j))
                    z+=h.get(j);
            if(max<z)
                max=z;
                    
        }
        Long z=0l;
        for(int i=0;i<y.length;i++)
        {
            
            for(long j=r[i]-y[i]<0?0:r[i]-y[i];j<=r[i]+y[i];j++)
                if(h.containsKey(j))
                {
                    z+=h.get(j);
                    h.remove(i);
                }     
        }
        return sum-z+max;
    }

    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();
    }
}