#include <iostream>
#include <vector>
using namespace std;

long maximumPeople(long P,vector <long> pops, vector <long> townx, vector <long> cloudy, vector <long> r)
{
    // Return the maximum number of people that will be in a sunny town after removing exactly one cloud.
    vector <long> store;
    int j=0;
    for(int i=0;i<cloudy.size();i++)
    {
        for(;j<cloudy[i]+r[i];j++)
        {
            if(townx[j]<=cloudy[i]+r[i]&&townx[j]>=cloudy[i]-r[i])
            {
                long t=pops[j];
                store.push_back(t);
                //cout<<pops[j]<<" "<<P<<"df\n";
                P-=pops[j];
            }
        }
    }
    long maxx=0;
    for(int i=0;i<store.size();i++)
        if(maxx < store[i]) maxx=store[i];

    return (P+maxx);
}

int main() {
    int n;
    cin >> n;
    vector<long> p(n);
    long P=0;
    for(int p_i = 0; p_i < n; p_i++){
       cin >> p[p_i];
       P+=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,p, x, y, r);
    cout << result << endl;
    return 0;
}