#!/bin/python

import sys

def maximumPeople(p, x, y, r):
    c=[]
    for j in xrange(m):
        c.append(0)
        for i in xrange(n):
            if y[j]-r[j]<=x[i] or y[j]+r[j]>=x[i]:
                c[j]+=p[i]
            if x[i]>y[j]+r[j]:
                break
    c.sort()
    s=0
    s1=0
    s2=0
    for a in xrange(n):
        for b in xrange(m-1):
            if x[a]>=y[b+1]-r[b+1] and x[a]<y[b]+r[b]:
                s+=p[a]
    for z in xrange(len(c)):
        s1+=c[z]
    for q in xrange(n):
        s2+=p[q]
    return c[-1]+s2-s1-s
                
                
        
        
        
        
        
        
        
        
    # Return the maximum number of people that will be in a sunny town after removing exactly one cloud.

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