#include <bits/stdc++.h>

using namespace std;

long maximumPeople(vector <long> &p, vector <long> &x, vector <long> &y, vector <long> &r) {
    // Return the maximum number of people that will be in a sunny town after removing exactly one cloud.
    vector<int> cloud(y.size());
    vector<int> town(p.size());
    int xpos=0,xneg=0,sum=0,population=0;
    for(int i=0;i<y.size();i++)
    {
        xpos=y[i]+r[i];
        xneg=y[i]-r[i];
        for(int j=0;j<p.size();j++)
        {
            if(x[j]>=xneg && x[j]<=xpos)
            {
                sum+=p[j];
                town[j]=1;
            }
        }
        cloud[i]=sum;
        sum=0;


    }

    sort(cloud.begin(),cloud.end());
    int hg=y.size();

    population=cloud[hg-1];
    for(int i=0;i<p.size();i++)
    {
        if(town[i]==0)
            population+=p[i];
    }
    return population;


}

int main() {
    int n;
    cin >> n;
    vector<long> p(n);
    for(int p_i = 0; p_i < n; p_i++){
       cin >> p[p_i];
    }
    vector<long> x(n);
    for(int x_i = 0; x_i < n; x_i++){
       cin >> x[x_i];
    }
    int m;
    cin >> m;
    vector<long> y(m);
    for(int y_i = 0; y_i < m; y_i++){
       cin >> y[y_i];
    }
    vector<long> r(m);
    for(int r_i = 0; r_i < m; r_i++){
       cin >> r[r_i];
    }
    long result = maximumPeople(p, x, y, r);
    cout << result << endl;
    return 0;
}