#!/bin/python3

import sys

def maximumPeople(p, x, y, r):
    b=[]
    for i in range(0,len(y)):
        rng1=y[i]-r[i]
        rng2=y[i]+r[i]
        tl=0
        sn=0
        for i in range(0,len(x)):
            if(x[i]>=rng1 and x[i]<=rng2):
                tl=tl+p[i]
                b.append(tl)
            else:
                sn=sn+p[i]
    return(sn+max(b))             
                
            
    # Return the maximum number of people that will be in a sunny town after removing exactly one cloud.

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)