#!/bin/python3

import sys
def range_of_cloud(a,b):
    ls=[]
    for i in range(a-b,a+b+1):
        ls.append(i)
    return(ls)
def maximumPeople(p, x, y, r):
    # Return the maximum number of people that will be in a sunny town after removing exactly one cloud.
    count_cities=len(p)
    covered=[False]*count_cities
    population_covered=[]
    for i in range(len(r)):
        rang=range_of_cloud(y[i],r[i])
        for j in range(count_cities):
            if x[j] in rang and covered[j] is False:
                population_covered.append(p[i])
                covered[j]=True
    s=0
    for i in range(count_cities):
        if covered[i] is False:
            s=s+x[i]
    max_covered=max(population_covered)
    return(max_covered+s)
    
    

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)