#!/bin/python

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.
    p1 = p2 = 0
    ans = 0
    ma = 0
    mark = [ 1 for _ in range(len(x))]
    for i in range(len(y)):
        m = 0
        for j in range(len(x)):
            if x[j] > y[i]+r[i]:
                break
            if y[i]-r[i]<= x[j] <= y[i]+r[i]:
                m += p[j]
                mark[j] = 0
        ma = max(ma,m)
    return sum([p[i] * mark[i] for i in range(len(x))]) + ma

if __name__ == "__main__":
    n = int(raw_input().strip())
    p = map(long, raw_input().strip().split(' '))
    x = map(long, raw_input().strip().split(' '))
    m = int(raw_input().strip())
    y = map(long, raw_input().strip().split(' '))
    r = map(long, raw_input().strip().split(' '))
    result = maximumPeople(p, x, y, r)
    print result