#include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
#include<bits/stdc++.h>
using namespace std;


int main() {
    /* Enter your code here. Read input from STDIN. Print output to STDOUT */   
    int n;
    cin>>n;
    pair<int,int>p[n+3];
    int arr[n+3],pos[n+3],vis[n+3];
    int pre[n+3]={0};
    for(int i=0;i<n;i++)
        cin>>arr[i];
    
     for(int i=0;i<n;i++){
        cin>>pos[i];
         vis[pos[i]]=1;
        p[i]=make_pair(pos[i],arr[i]);
     }
    
    sort(p,p+n);
    
    for(int i=0;i<n;i++){
        pre[p[i].first]=pre[p[i].first-1]+p[i].second;
    }
    int m;
    cin>>m;
    int cloud[m+3],pos1[m+3];
    for(int i=0;i<m;i++)
        cin>>cloud[i];
    
    for(int i=0;i<m;i++){
             cin>>pos1[i];
    }
    int ans=0;
    for(int i=0;i<n;i++){
        int c=0;
        for(int j=0;j<m;j++)
            if( pos[i]<=(cloud[j]+pos[j]) &&  pos[i]>=(cloud[j]-pos[j]))
                c++;
            if(c==0)
                ans+=arr[i];
    }
    
    
        
  
  
    int max1=INT_MIN;
    for(int i=0;i<m;i++){
        int r=pre[cloud[i]+pos1[i]];
        int e=pre[cloud[i]-pos1[i]];
        max1=max(max1,r+e);
    }
    cout<<ans+max1;
    return 0;
}