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.
        //assuming x n y are sorted
        
        long[] cloudrange1 = new long[y.length];
        long[] cloudrange2 = new long[y.length];
        for(int i=0;i<y.length;i++)
        {
            cloudrange1[i]=y[i]-r[i];
            cloudrange2[i]=y[i]+r[i];
        }
        Map<Integer,Long> cloudpopCoverage = new HashMap<Integer,Long>();
        boolean[] sunnytowns = new boolean[x.length];
        for(int i=0;i<y.length;i++)
        {
            for(int j=0;j<x.length;j++)
            {
                if(x[j]>=cloudrange1[i] && x[j]<=cloudrange2[i])
                {
                    if(cloudpopCoverage.get(i)==null)
                        cloudpopCoverage.put(i,p[j]);
                    else
                    {
                        cloudpopCoverage.put(i,p[j]+cloudpopCoverage.get(i));
                    }
                    sunnytowns[j]=false;
                }
                else
                {
                    sunnytowns[j]=true;
                }
            }
        }
        Long maxPop=0L;
        int index=-1;
        for(Map.Entry<Integer,Long> e:cloudpopCoverage.entrySet())
        {
            if(e.getValue()>maxPop)
            {
                index=e.getKey();
                maxPop=e.getValue();
            }
        }
        Long sunnypop = 0L;
        for(int i=0;i<sunnytowns.length;i++)
        {
            if(sunnytowns[i])
            {
                sunnypop+=p[i];
            }
        }
        return sunnypop+maxPop;
        
        
    }

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