import java.io.*;
import java.util.*;
import java.math.*;
import java.lang.*;
import java.util.regex.*;
class Solution{
	public static void main(String[] args)throws Exception{
		new Solution().solve();
	}
	public static void solve()throws Exception{
		String[] s;
		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
		int n = Integer.parseInt(br.readLine());
		int[] population = new int[n];
		int[] cityLocation = new int[n];
		s = br.readLine().split(" ");
		for(int i=0;i<n;i++){
			population[i] = Integer.parseInt(s[i]);
		}
		s = br.readLine().split(" ");
		for(int i=0;i<n;i++){
			cityLocation[i] = Integer.parseInt(s[i]);
		}
		int m = Integer.parseInt(br.readLine());
		int[] cloudLocation = new int[m];
		int[] cloudRange = new int[m];
		s = br.readLine().split(" ");
		for(int i=0;i<m;i++){
			cloudLocation[i] = Integer.parseInt(s[i]);
		}
		for(int i=0;i<m;i++){
			cloudRange[i] = Integer.parseInt(s[i]);
		}
		br.close();
		System.out.println(sunnyPeople(population,cityLocation,cloudLocation,cloudRange));
	}
	public static int sunnyPeople(int[] population,int[] cityLocation,int[] cloudLocation,int[] cloudRange){
		int n = population.length;
		int m = cloudLocation.length;
		int min = 0;
		int darkPeople = Integer.MAX_VALUE;
		for(int i=0;i<m;i++){
			int minRange = cloudLocation[i]-cloudRange[i]-1;
			if(minRange<0)
				minRange=0;
			int maxRange = cloudLocation[i]+cloudRange[i]-1;
			if(maxRange>=n)
				maxRange=n-1;
			for(int j=minRange;j<=maxRange;j++){
				int city=j;
				for(int k=0;k<n;k++){
					if(cityLocation[k]==j){
						min += population[k];
					}
				}
				if(min<darkPeople){
					darkPeople = min;
					min = 0;
				}
			}
		}
		int sum = 0;
		for(int i=0;i<n;i++)
			sum += population[i];
		return (sum-darkPeople);
	}
}