#!/bin/python3

import sys

def maximumPeople(p, x,m, y, r):
    # Return the maximum number of people that will be in a sunny town after removing exactly one cloud.
    rangUpper=[]
    rangLower=[]
    term=len(p)
    for i in range(m):
        rangLower.append(y[i]-r[i])
        rangUpper.append(y[i]+r[i])
    total=sum(p)
    for j in range(term):
        for k in range(m):
            if x[j]>=rangLower[k] and x[j]<=rangUpper[k]:
                total-=x[j]
    an=[]
    for j in range(term):
        for k in range(m):
            if x[j]>=rangLower[k] and x[j]<=rangUpper[k]:
                an.append(total+x[j])
    return max(an)
if __name__ == "__main__":
    n = int(input().strip())
    p = list(map(int, input().strip().split(' ')))
    x = list(map(int, input().strip().split(' ')))
    m = int(input())
    y = list(map(int, input().strip().split(' ')))
    r = list(map(int, input().strip().split(' ')))
    result = maximumPeople(p, x,m, y, r)
    print(result)