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.
        HashMap<Long,Long> hm=new HashMap<Long,Long>();
        for(int i=0;i<y.length;i++)
        {
            hm.put((y[i]-r[i]),(y[i]+r[i]));
        }
        long popu=0;
        for(int i=0;i<x.length;i++){
            int count=0;
        for(Map.Entry m:hm.entrySet()){
            if(x[i]>=(long)m.getKey()&& x[i]<=(long)m.getValue())
                 {
                     count++;
                     break;
                 }
            }
            if(count==0)
                popu+=p[i];
        }
        long max=0;
         for(Map.Entry m:hm.entrySet()){
             long pop=0;
             for(int i=0;i<x.length;i++)
             {
                 if(x[i]>=(long)m.getKey()&& x[i]<=(long)m.getValue())
                 {
                     pop+=p[i];
                 }
             }
             if(max<pop)
                 max=pop;
         }
        return max+popu;
        
    }

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