#!/bin/python

import sys

def maximumPeople(p, x, y, r):
    # Return the maximum number of people that will be in a sunny town after removing exactly one cloud.
    numofcloud=[]
    for i in range(len(x)):
        numofcloud.append(0)
    for i in range(len(y)):
        r=y[i]-r[i],y[i]+r[i]
        for j in range(len(x)):
            if r[0]<=x[j] and x[j]<=r[1]:
                numofcloud[j]+=1
            
    m=p[0],0
    for i in range(len(numofcloud)):
        if numofcloud[i]==1:
            if p[i]>m[0]:
                m=p[i],i
    numofcloud[m[1]]=0
    ans=0
    for i in range(len(numofcloud)):
        if numofcloud[i]==0:
            ans+=p[i]
    return ans

if __name__ == "__main__":
    n = int(raw_input().strip())
    p = map(long, raw_input().strip().split(' '))
    x = map(long, raw_input().strip().split(' '))
    m = int(raw_input().strip())
    y = map(long, raw_input().strip().split(' '))
    r = map(long, raw_input().strip().split(' '))
    result = maximumPeople(p, x, y, r)
    print result