#include <math.h>
#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <assert.h>
#include <limits.h>
#include <stdbool.h>



int main() {
    long long int n,temp,sort,i,j,k,sum1;
    scanf("%lld", &n);
    long long int *p = malloc(sizeof(long int) * n);
    for (long long int p_i = 0; p_i < n; p_i++) {
       scanf("%lld",&p[p_i]);
    }
    long long int *x = malloc(sizeof(long int) * n);
    for (long long int x_i = 0; x_i < n; x_i++) {
       scanf("%lld",&x[x_i]);
    }
    long long int m;
    scanf("%lld", &m);
    long long int *y = malloc(sizeof(long int) * m);
    for (long long int y_i = 0; y_i < m; y_i++) {
       scanf("%lld",&y[y_i]);
    }
    long long int *r = malloc(sizeof(long int) * m);
    for (long long int r_i = 0; r_i < m; r_i++) {
       scanf("%lld",&r[r_i]);
    }
    long long int diff[m],sum[m];
    for(i=0;i<m;i++){
        diff[i] = y[i] - r[i];
        sum[i] = y[i] + r[i];
    }
    k=0;
    sum1=0;
    long long int rem[m],count;
    for(i=0;i<n;i++){
        count=n;
        for(j=0;j<n;j++){
            if(x[i]<=sum[j] && x[i]>=diff[j]){
            rem[k]=p[i];
            k++;
            count--;
            }
        } if(count==n){
            sum1+=p[i];
        }
    }
    while(1){
        sort=0;
        for(i=0;i<k-1;i++){
        if(rem[i]>rem[i+1]){
            temp=rem[i];
            rem[i]=rem[i+1];
            rem[i+1]=temp;
            sort=1;
        }
    } if(sort==0){
    break;
    }
    }
    printf("%lld\n", sum1 + rem[0]);
    return 0;
}