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

public class Solution {

    static long maximumPeople(int n,long[] p, long[] x, long[] y, long[] r,int m) {
        // Return the maximum number of people that will be in a sunny town after removing exactly one cloud.
        long max = 0;
        long pres = 0;
        long res = 0;
        long sunny = 0;
        for(int i =0;i<m;i++){
            long rang1 = y[i] + r[i];
            long rang2 = y[i] + r[i];
           
            
            for(int j =0;j<n;j++){
                 int flag = 0;
                if(x[j] >= rang1 && x[j] <= rang2 ){
                 pres = x[j] - y[i];
                    flag = 1;
                  }
                if(pres > max){
                    max = pres;
                    res = p[j];
                    
                }
                if(flag == 0)
            sunny = sunny + p[j];
                
            }
            
           
            
        }
         return sunny + res;
    }

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