#!/bin/python3

import sys

def maximumPeople(pop, town, cloud, rng):
    dark=0
    c=0
    sunny=0
    total=sum(pop)
    # Return the maximum number of people that will be in a sunny town after removing exactly one cloud.
    for i in town:
        for j in range(len(cloud)):
            if (i<(cloud[j]+rng[j]) and i>(cloud[j]-rng[j])):
                dark=dark+pop[town.index(i)]
                c=max(c,pop[town.index(i)])
    sunny=total-dark+c
    return(sunny)
if __name__ == "__main__":
    n = int(input().strip())
    p = list(map(int, input().strip().split(' ')))#population
    x = list(map(int, input().strip().split(' ')))#town position
    m = int(input().strip())#number of clouds
    y = list(map(int, input().strip().split(' ')))#cloud position
    r = list(map(int, input().strip().split(' ')))#Range of cloud
    result = maximumPeople(p, x, y, r)
    print(result)