#include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
using namespace std;
struct t
{
    long loca;
    long pop;
};
bool compare(t a,t b)
{
    return (a.pop>b.pop);
}
int main() {
    long n,pi,l;
    cin>>n;
    t p[n];
    
        
    for(int i=0;i<n;i++)
    {cin>>p[i].pop;
     //cout<<p[i].pop;
    } 
    for(int i=0;i<n;i++)
    {
        cin>>p[i].loca;
    }
    sort(p,p+n,compare);
    long c,r;
    cin>>c;
    //cout<<c<<endl;
    long cl[c];
    for(int i=0;i<c;i++)
    {
        cin>>cl[i];
        //cout<<cl[i]<<"  ";
       // cout<<endl;
    }
    cin>>r;
    long s=0;
    long f=0;
    for(int i=0;i<n;i++)
    {
        long lo=p[i].loca;
        
        for(int j=0;j<c;j++)
        {//cout<<lo<<"  "<<cl[j]-r<<"  "<<cl[j]+r<<endl;
            if(lo>=cl[j]-r && lo<=cl[j]+r)
            {
   
            f=1;
            s+=p[i].pop;
             break;   
            }
            
                
        }
        if(f==1)
            break;
     
    }
   
     for(int i=0;i<n;i++)
    { f=0;
        long lo=p[i].loca;
        
        for(int j=0;j<c;j++)
        {
            if(lo>=cl[j]-r && lo<=cl[j]+r)
            {
                f=1;
               break;}
            
        }
         if(f==0)
             s+=p[i].pop;
     }     
    cout<<s;
    /* Enter your code here. Read input from STDIN. Print output to STDOUT */   
    return 0;
}