import java.io.*;
import java.util.*;
import java.text.*;
import java.math.*;
import java.util.regex.*;

public class Solution {

    static long maximumPeople(int n, int m, long[] p, long[] x, long[] y, long[] r) 
    {
        long ll = 0, rl = 0, pop = 0, max = 0;
        for(int i=0; i<m ;i++)
        {
            ll = y[i] - r[i];
            rl = y[i] + r[i];
            for(int j=0;j<n;j++)
            {
                if(x[j]>=ll&&x[j]<=rl)
                {
                    if(max<=p[j])
                    {
                        max = p[j];
                    }
                }                
            }
        }        
        for(int i=0;i<n;i++)
        {
            int count = 0;
            for(int j=0;j<m;j++)
            {
                ll = y[j] - r[j];
                rl = y[j] + r[j];
                //System.out.println("LL and RL are: "+ll+" "+rl);
                //System.out.println("p[i] :"+p[i]);                
                if((x[i]>=ll&&x[i]<=rl)==false)
                {
                    count++;
                }
            }
            //System.out.println("Count :"+count);
            if(count==m)
            {
                pop = pop + p[i];
            }
        }
        //System.out.println("Pop: "+pop);
        //System.out.println("Max: "+max);        
        long ans = pop + max;
        return ans;
    }

    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(n, m, p, x, y, r);
        System.out.println(result);
        in.close();
    }
}