#!/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.
    sunny_towns = 0;
    dark = []
    
    for i in range(len(y)):
        low_range = y[i] - r[i] - 1
        high_range = y[i] + r[i] + 1
        cloud_range = [range(low_range,high_range)]
        
        for j in range(len(x)):
            if x[j] in cloud_range:
                dark.append(j)
            else:
                sunny_towns += p[j] 
                
    max_po = 0
    
    for i in dark:
        if(p[i] > max_po):
            max_po = p[i]
            
    return sunny_towns + max_po

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)