#include <bits/stdc++.h>
#include <algorithm>
using namespace std;

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];
    }
    bool arr[n+1];
    long work[n],ans=0;
    memset(arr,true,sizeof(n));
    for(int i=0;i<m;i++)
    {
     if(y[i]-r[i]<=x[i]||y[i]-r[i]>=x[i])
     {
      work[i]=p[i];
      arr[i]=false;   
     }   
    }
    sort(work,work+n);
    for(int i=0;i<n;i++)
    {
     if(arr[i])
     {
      ans=ans+p[i];   
     }   
    }
    ans=ans+work[n-1];
    cout<<ans;
    return 0;
}