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

bool isCloudy(int pos, vector<int> cloc, vector<int> crange){
    for(int i=0; i<cloc.size(); i++){
        if(pos >= cloc[i] - crange[i] && pos <= cloc[i] - crange[i])
            return true;
    }
    return false;
}

int getTotal(vector<int> pop, vector<int> loc, vector<int> cloc, vector<int> crange){
    int max = 0;
    int tot = 0;
    for(int i=0; i<pop.size(); i++){
        if(isCloudy(loc[i], cloc, crange)){
            if(pop[i] > max)
                max = pop[i];
        }
        else{
            tot += pop[i];
        }
    }
    return tot+max;
}

int main() {
    int n;
    cin>>n;
    vector<int> pop(n);
    vector<int> loc(n);
    for(int i=0; i<n; i++)
        cin>>pop[i];
    for(int i=0; i<n; i++)
        cin>>loc[i];
    
    int m;
    cin>>m;
    vector<int> cloc(m);
    vector<int> crange(m);
    
    cout<<getTotal(pop, loc, cloc, crange);
    return 0;
}