#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> P(200010,0);
    vector<vector<int>> C(200010,vector<int>(0));
    vector<vector<int>> D(200010,vector<int>(0));
    for(int i=0;i<x.size();i++){
        P[x[i]] = p[i];
    }
    for(int i=0;i<y.size();i++){
        int numm = y[i] - r[i];
        int numM = y[i] + r[i];
        if(numm < 0)
            numm = 0;
        if(numM > 200000)
            numM = 200000;
        C[numm].push_back(i);
        D[numM].push_back(i);
    }
    set<int> activeC;
    long ans = 0;
    vector<int> ansC(y.size(),0);
    for(int i=0;i<200010;i++){
        for(int j=0;j<C[i].size();j++){
            activeC.insert(C[i][j]);
        }
        if(activeC.size() == 0){
            ans+= P[i];
        }
        if(activeC.size() == 1){
            set<int>::iterator it=activeC.begin();
            ansC[*it] += P[i];
        }
        for(int j=0;j<D[i].size();j++){
            activeC.erase(activeC.find(D[i][j]));
        }
    }
    int max = -1;
    for(int i=0;i<y.size();i++){
        if(max < ansC[i])
            max = ansC[i];
    }
    return ans + max;
    
}

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