#include <bits/stdc++.h>

using namespace std;

long maximumPeople(vector <long> p, vector <long> x, vector <long> y, vector <long> r,int n,int m) {
    // Return the maximum number of people that will be in a sunny town after removing exactly one cloud.
  vector <long> v;
    vector <long> v1;
   int pop=0;
    if(m==1){
       for(int w=0;w<n;w++){
           pop=pop+p[w];
       }
   return pop;} 
    for(int i=0;i<m;i++){
        for(int j=0;j<n;j++){
            if(y[i]-r[i]==x[j]||y[i]+r[i]==x[j])
                v.push_back(j);
            else
            v1.push_back(j);
        }
    }int max=1;
    for(int k=0;k<v.size();k++){
        if(p[v[k]]>max)max=p[v[k]];
    }int sum=0;
    for(int q=0;q<v1.size();q++){
        sum=sum+p[v1[q]];
    }
return(sum+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,n,m);
    cout << result << endl;
    return 0;
}