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) {
        long d1=0;
        long d2=0;
        long maxp=0;
        long cntp=0;
        for(int i=0;i<y.length;i++)
        {
            d1=y[i]-r[i];
            d2=y[i]+r[i];
            cntp=0;
            for(int j=0;j<p.length;j++)
            {
                if(x[j]==d1)
                {
                    cntp=cntp+p[j];
                }
                if(x[j]==d2)
                {
                    cntp=cntp+p[j];
                }
                if(x[j]==r[i])
                {
                    cntp=cntp+p[j];
                }
                if(cntp>=maxp)
                    maxp=cntp;
            }
        }
        
        for(int i=0;i<x.length;i++)
        {
            int flag=0;
            for(int j=0;j<y.length;j++)
            {
                d1=y[j]-r[j];
                d2=y[j]+r[j];
                if(x[i]==d1)
                {
                    flag=1;
                    break;
                }
                if(x[i]==d2)
                {
                    flag=1;
                    break;
                }
                if(x[i]==r[j])
                {
                    flag=1;
                    break;
                }
            }
            if(flag==0)
            {
                maxp=maxp+p[i];
            }
        }
        return maxp;
    }

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