#!/bin/python3

import sys
def maximumPeople(p, x, y, r):
    n=len(p)
    m=len(y)
    c=[]
    d=[]
    ne=[]
    f=0
    for i in range(0,m):
        c.append(y[i]-r[i])
        d.append(y[i]+r[i])
        t1=(y[i]-r[i])
        t2=y[i]+r[i]
        for g in range(t1,t2+1):
            for j in range(0,m):
                if(g==y[j]):
                    f=f+p[j]
                    ne.append(p[j])
    for i in range(0,len(c)):
        for j in range(0,m):
            if(i==y[j]):
                ne.append(p[j])
    for i in range(0,len(ne)):
        z=0
        for j in range(0,len(p)):
            if(p[j]==ne[i]):
                z=z+1
        print(z)      
        if(z==0):
            f=f+p[j]
    print(f)
            
    
    # 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)