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.
        long len = y.length;
        long max=0;
        long sum=0;
        int maxRange=0;
        long maxp=0;
        if(y.length==1)
        {
            for(int i=0;i<p.length;i++)
                sum  = sum+ p[i];
            return sum;
        }
        else{
            for(int j=0;j< r.length; j++){
                if(r[j]>max)
                   maxRange=j; 
            }
            long posc= y[maxRange];
           long range1 = posc- r[maxRange];
            long range2 = posc + r[maxRange];
            for(int k=0;k<p.length; k++)
            {
                if(x[k]<=range2 && x[k]>= range1)
                    maxp  =max + p[k];
            }
            return maxp;
        }
            
    }

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