#include<iostream>
#include<algorithm>
using namespace std;
long long maximum(long long x,long long y){
    if(x>y)
        return x;
    return y;
}
int main(){
    long long  n;
    cin>>n;
    int population[n];
    for(long long  i=0;i<n;i++)
        cin>>population[i];
    long long position[n];
    for(long long i=0;i<n;i++)
        cin>>position[i];
    long long  m;
    cin>>m;
    long long cloud[m],range[m];
    for(long long i=0;i<m;i++)
        cin>>cloud[i];
    for(long long i=0;i<m;i++)
        cin>>range[i];
    long long max=0;
    long long sum=0;
    for(long long i=0;i<m;i++){
        sum=0;
        for(long long j=0;j<n;j++){
            if(cloud[i]-range[i]<=position[j]&&position[j]<=cloud[i]+range[i])
                max=maximum(max,population[j]);
            else
                sum+=population[j];       
        }
    }
    cout<<sum+max;
}