#!/bin/python3

import sys

def maximumPeople(p, x, y, r, n, m):
    # Return the maximum number of people that will be in a sunny town after removing exactly one cloud.
    cities={}
    for i in range(n):
        cities[x[i]]=p[i]
    clouds={}
    cloud_covered=set()
    forbidden_cities=set()
    for i in range(m):
        clouds[y[i]]=(y[i]-r[i],y[i]+r[i])
        for j in range(y[i]-r[i],y[i]+r[i]+1):
            if(j in cloud_covered):
                forbidden_cities.add(j)
            else:
                cloud_covered.add(j)
                
    forbidden_cities=list(forbidden_cities)
    for i in forbidden_cities:
        try:
            del cities[i]
        except:
            continue
    
    cloud_keys=list(clouds.keys())
    population_under_cloud=[]
    
    for i in cloud_keys:
        temp=0
        for j in range(clouds[i][0],clouds[i][1]+1):
            try:
                temp+=cities[j]
            except:
                continue
        population_under_cloud.append(temp)
     
    sunshine=0
    for i in x:
        if(i not in cloud_covered):
            sunshine+=cities[i]
            
    return sunshine+max(population_under_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, n, m)
    print(result)