#include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
using namespace std;


int main() {
    /* Enter your code here. Read input from STDIN. Print output to STDOUT */   
    long n,*p,*l,c,*reg,*range,i,j,ans[10000000]={0},ansrev=0;
    cin>>n;
    p=new long[n];
    l=new long[n];
    for(i=0;i<n;i++)
    {
        cin>>p[i];
    }
    for(i=0;i<n;i++)
    {
        cin>>l[i];
    }
    cin>>c;
    reg=new long[c];
    range=new long[c];
    for(i=0;i<c;i++)
    {
        cin>>reg[i];
    }
    for(i=0;i<c;i++)
    {
        cin>>range[i];
    }
    int count=0;
    for(j=0;j<c;j++)
    {
        for(i=0;i<n;i++)
        {
            if(l[i]<=(reg[j]+range[j]) && l[i]>=(reg[j]-range[j]))
            {
                ans[count]=p[i];count++;
            }
            else
            {
                ansrev+=p[i];
            }
        }
    }
    //int nani= max_element(ans,ans+7);
    sort(ans,ans+count);
    cout<<ansrev+ans[count-1];
    return 0;
}