#!/bin/python

import sys

def maximumPeople(p, x, y, r):
    d=[]
    for i in range(m):
        d.append(y[i]-r[i])
        d.append(y[i])
        d.append(y[i]+r[i])
    a=[]
    tot=0
    for j in range(n):
        if x[j] in d:
            a.append(p[j])
        else:
            tot+=p[j]
    return tot+max(a)
    # 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