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 max = 0,total = 0,maxP = 0;
        for(int i=0;i<p.length;++i){
            total+=p[i];
            maxP = Math.max(maxP,p[i]);
        }
        //if there is one cloud remove it and return the total sum
        if(y.length==1)
            return total;
        long[] s = new long[y.length];
        
        long ran = 0;
        long rani = 0;
        total = 0;
        for(int i=0;i<y.length;++i){
           if(y[i]+r[i]>=x[i]){
               s[i]+=p[i];
               total-=p[i];
           }
           if(i>0 && y[i]-r[i]<=x[i-1]){
               s[i]+=p[i-1];
           }
        }

        
        for(int i=0;i<s.length;++i){
            max = Math.max(max,s[i]);
        }
        
        return total+max;
        
    }

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