#include <bits/stdc++.h>

using namespace std;

long nearby(int x,vector<long> v){
    sort(v.begin(),v.end());
    int i=0;
    while(x<v[i]){
        i++;
    }
    return i;
}

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.
    int n_clouds = y.size();
    if(n_clouds==1) {
        long sum=0;
        for(int j=0;j<p.size();j++){
            sum += p[j];
        }
        return sum;
    }
    
    vector <long> pop_cover;
    
   for(int i=0;i<n_clouds;i++){
        long cloud_loc = y[i];
        long cloud_range = r[i]; 
        int pop_count=0;
        long pos;
        if(cloud_loc-cloud_range<0)
            pos=0;
        else
           pos= nearby(cloud_loc-cloud_range,x);
       
        while(x[pos]<=cloud_loc+cloud_range){
            pop_count +=p[pos];
            pos++;
            
        }
        pop_cover.push_back(pop_count);
    }
    sort(pop_cover.begin(),pop_cover.end());
    return pop_cover[pop_cover.size()-1];
    
}

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