import java.util.*;
class Problem2 
{
    public static void main(String args[])
    {
        Scanner sc=new Scanner(System.in);
        int i,j,k,l,m,n,c=0;
        long sum=0,prod=0;
        n=sc.nextInt();
        long poptown[]=new long[n];
        long postown[]=new long[n];
        for(i=0;i<n;i++)
        {
            poptown[i]=sc.nextLong();
            prod+=poptown[i];
        }
        for(i=0;i<n;i++)
        {
            postown[i]=sc.nextLong();
        }
        m=sc.nextInt();
        long poscld[]=new long[m];
        long range[]=new long[m];
        for(i=0;i<m;i++)
        {
            poscld[i]=sc.nextLong();
        }
        for(i=0;i<m;i++)
        {
            range[i]=sc.nextLong();
        }
        long eff[]=new long[m];
        for(i=0;i<m;i++)
        {
            long x=poscld[i]-range[i];
            long y=poscld[i]+range[i];
            for(j=0;j<n;j++)
            {
                if(postown[i]>=x&&postown[i]<=y)
                {
                    sum+=poptown[i];
                }
            }
            eff[c++]=sum;
            sum=0;
        }
        Arrays.sort(eff);
        long ex=0;
        for(i=0;i<c-1;i++)
        {
            ex+=eff[i];
        }
        System.out.println(prod-ex);
    }
}