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.
        long cloudno=y.length;
        long max=0,index=-1;
        for(int i=0;i<cloudno;i++)
        {
            long c=0;
            long j=y[i];
            long h=j+r[i];
            long g=j-r[i];
            for(int k=0;k<x.length&&x[k]<=h;k++)
            {
                if(x[k]==h)
                    c+=p[k];
                if(x[k]==j)
                    c+=p[k];
                if(x[k]==g)
                    c+=p[k];
                if(max<c)
                {
                    max=c;
                    index=k;
                }
            }
        }
        long sum=0;
        for(int i=0;i<p.length;i++)
            sum+=p[i];
        ArrayList<Long>al=new ArrayList<Long>();
        for(int i=0;i<cloudno;i++)
        {
            long j=y[i];
            long h=j+r[i];
            long g=j-r[i];
            if(!(al.contains(j)))
                al.add(j);
            if(!(al.contains(h)))
                al.add(h);
            if(!(al.contains(g)))
                al.add(g);
        }
        long pop=0;
        for(int i=0;i<p.length;i++)
        {
            if(!(al.contains(x[i])))
               pop+=p[i];
        }
        pop+=max;
          
               
        return pop;
         
        
    }

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