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

long int maximumPeople(int p_size, long int p[], int x_size, long int x[], int y_size, long int y[], int r_size, long int r[])
{
    int b[1000],a[1000],i,sum=0,high_popu,high_loc;
  if(y_size==0||y_size==1)
  {
      for(i=0;i<p_size;i++)
      {
          sum=sum+p[i];
      }
      return sum;
  }   
    
  
    
    
    
    
   if(y_size>1)
   {
     for(i=0;i<y_size;i++)
     {
         a[i]=y[i]-r[i];
         b[i]=y[i]+r[i];
     }
    
       
       
       
      high_popu=p[0];  
    for(i=0;i<p_size;i++)
    {
       if(p[i]>high_popu)
       { high_popu=p[i];
            high_loc=i;       
       } 
    }
       
       for(i=0;i<y_size;i++)
       {
       if(x[high_loc]>a[i]||x[high_loc]<b[i])
       {
         for(i=0;i<p_size;i++)
          {
          sum=sum+p[i];
          }
           return sum;  
       }
       
       }
       
       
   }
    
   return 0; 
    
    
    
    
}

int main() {
    int n; 
    scanf("%i", &n);
    long int *p = malloc(sizeof(long int) * n);
    for (int p_i = 0; p_i < n; p_i++) {
       scanf("%li",&p[p_i]);
    }
    long int *x = malloc(sizeof(long int) * n);
    for (int x_i = 0; x_i < n; x_i++) {
       scanf("%li",&x[x_i]);
    }
    int m; 
    scanf("%i", &m);
    long int *y = malloc(sizeof(long int) * m);
    for (int y_i = 0; y_i < m; y_i++) {
       scanf("%li",&y[y_i]);
    }
    long int *r = malloc(sizeof(long int) * m);
    for (int r_i = 0; r_i < m; r_i++) {
       scanf("%li",&r[r_i]);
    }
    long int result = maximumPeople(n, p, n, x, m, y, m, r);
    printf("%ld\n", result);
    return 0;
}