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


int main() {
    /* Enter your code here. Read input from STDIN. Print output to STDOUT */  
    int n;
    cin>>n;
    int house;
    int cloud;
    
    int house_pop[n];
    int house_pos[n];
    for(int i=0;i<n;i++){
        
        cin>>house_pop[i];
     }
    for(int i=0;i<n;i++){
        cin>>house_pos[i];
    }
    int num_cloud;
    cin>>num_cloud;
    int cloud_pos[num_cloud];
    int cloud_range[num_cloud];
    for(int i=0;i<num_cloud;i++){
        cin>>cloud_pos[i];
    }
    for(int i=0;i<num_cloud;i++){
        cin>>cloud_range[i];
    }
    int cloud_pop[num_cloud];
    for(int i=0;i<num_cloud;i++){
        cloud_pop[i]=0;
        for(int j=0;j<n;j++){
            if(cloud_pos[i]-cloud_range[i]<=house_pos[j]<=cloud_pos[i]+cloud_range[i]){
                cloud_pop[i]=cloud_pop[i]+house_pop[j];
            }
        }
    }
    int req=distance(cloud_pop, max_element(cloud_pop, cloud_pop + num_cloud));
    int ans=accumulate(house_pop,house_pop+n,0)-accumulate(cloud_pop,cloud_pop+num_cloud,0)+cloud_pop[req];
    cout<<ans;
    return 0;
}