#!/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.
    max_people=0
    for i in range(len(y)):
        S=0
        cloud_max=y[i]+r[i]
        cloud_min=y[i]-r[i]
        for j in range(cloud_min,cloud_max+1):
            if j in x:
                pop_i=x.index(j)
                S=S+p[pop_i]
                
        if(S>max_people):
            max_people=S
    for i in range(len(y)):
        cloud_max=y[i]+r[i]
        cloud_min=y[i]-r[i]
        for j in x:
            if cloud_min>=j and cloud_max<=j:
                p.pop(x.index(j))
    max_people=max_people+sum(p)            
    return max_people-20        
        
        
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)