#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 */
    
    //inputs
    int n,m,i,j;
    
    cin >> n;
    int pop[n],loc[n];
    
    for(i=0;i<n;i++){
        
        cin >> pop[i];
        
    }
    for(i=0;i<n;i++){
        
        cin >> loc[i];
        
    }
    
    cin >> m;
    int cloc[m],range[m];
    
    for(i=0;i<m;i++){
        
        cin >> cloc[i];
        
    }
    for(i=0;i<m;i++){
        
        cin >> range[i];
        
    }
    
    //functions
    
    int tcbc[n];
    for(i=0;i<n;i++){
        tcbc[i] = 0;
    }
    
    for(i=0;i<n;i++){
        
        for(j=0;j<m;j++){
            
            if((loc[i] >= cloc[j]-range[j]) && (loc[i] <= cloc[j]+range[j])){
                
                tcbc[i] = 1;
                break;
                
            }
            
        }
        
    }
    
    int popuc = 0;
    
    int maxpop = 0;
    int maxi;
    
    for(i=0;i<n;i++){
        
        if(tcbc[i] == 0){
            if(maxpop < pop[i]){
                maxpop = pop[i];
                maxi = i;                
            }
        }
        else{
            popuc += pop[i];
            pop[i] = 0;
        }
        
    }
    
    popuc += maxpop;
    
    cout << popuc;
    
    /**for(i=0;i<n;i++){
        cout << tcbc[i] << " ";
    }*/
    
    return 0;
}