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 g=0;
        int pg=0;
        int i,j;
        int n=x.length;
        int m=y.length;
        for(i=0;i<n;i++)
       {
            for(j=0;j<m;j++)
            {
                if(x[i]==(y[j]-r[j])||(x[i]==(y[j]+r[j])))
                {
                    if(p[i]>g)
                    {g=p[i];}
                }
            }
        }
        long sum=0;
        for(i=0;i<n;i++)
        {
            for(j=0;j<m;j++)
            {
                if(!((x[i]==(y[j]-r[j])||(x[i]==(y[j]+r[j])))))
                {
                    pg=1;
                }
                else{pg=0;}
            }
            if(pg==1)
            sum+=p[i];
            
        }
            sum+=g;
        return sum;
    }

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