#!/bin/python3

import sys

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

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)