#!/bin/python3

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.
    d={}
    sum=0
    for i in range(len(p)):
        sum+=p[i]
    for i in range(len(y)):
        if(y[i] in x):
            d[y[i]]=p[x.index(y[i])]
            sum-=p[x.index(y[i])]
        if(y[i]+r[i] in x):
            d[y[i]+r[i]]=p[x.index(y[i]+r[i])]
            sum-=p[x.index(y[i]+r[i])]
        if(y[i]-r[i] in x):
            d[y[i]-r[i]]=p[x.index(y[i]-r[i])]
            sum-=p[x.index(y[i]-r[i])]
    v=list(d.values())
    k=max(v)
    sum+=k
    return sum

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