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


int main() {  int n,m,sum=0,max=-1;
            cin>>n;
            int p[n],l[n];
            for(int i=0;i<n;i++)
                cin>>p[i];
            for(int i=0;i<n;i++)
                cin>>l[i];
            cin>>m;
            int y[m],r[m];
            for(int i=0;i<m;i++)
                cin>>y[i];
            for(int i=0;i<m;i++)
                cin>>r[i];
            int count[n]={0};
            for(int i=0;i<m;i++){
                for(int j=0;j<n;j++){
                  if(y[i]-r[i]<=l[j] && y[i]+r[i]>=l[j])
                      count[j]++;
                }
            }
            for(int i=0;i<n;i++){
                if(count[i]==0)
                    sum+=p[i];
                else if(count[i]==1){
                    if(max<p[i])
                        max=p[i];
                }  
            } 
            if(max!=-1)
            cout<<sum+max;
            else cout<<max;
    /* Enter your code here. Read input from STDIN. Print output to STDOUT */   
    return 0;
}