#include <bits/stdc++.h>

using namespace std;

long max(vector<long> p)  {
    long max=-1;
    for(int i=0;i<p.size();i++) {
        if(p[i]>max)
            max=p[i];
    }
    return max;
}

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.
    long n = max(p)+1;
    long arr[n]={0};
    for(int i=0;i<p.size();i++) {
        arr[x[i]]=p[i];
    }
    vector<long> people;
    int visited[n]={0};
    for(int i=0;i<y.size();i++) {
        long sum = 0;
        for(int j=y[i]-r[i];j<=y[i]+r[i];i++)   {
            if(j>=1)    {
                sum += arr[j];
                visited[i]=1;
            }
        }
        people.push_back(sum);
    }
    long sunny=0;
    for(int i=1;i<n;i++)
        if(visited[i] != 1)
          sunny += arr[i];
    return sunny + max(people);
}

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