#!/bin/python3

import sys

def maximumPeople(p, x, y, r):
    # Return the maximum number of people that will be in a sunny town after removing exactly one cloud.
    loc = [0]*len(x)
    for cl_pos, cl_range in zip(y,r):
        for idx in range(max(0,cl_pos - cl_range), min(len(x)-1,cl_pos + cl_range + 1)):
            loc[idx] += 1
            
    l = list(zip(p, range(len(p))))
    l.sort(reverse = True)
    #print("l is",l)

    for e in l:
        if loc[e[1]] > 0:
            loc[e[1]] = 0
            break
    
    ssum = 0
    for index,elem in enumerate(p):
        if loc[index] == 0:
            ssum += elem
    
    return ssum
    #return sum([elem for elem,index in enumerate(p) if loc[index] == 0])
    

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)