import java.io.*;
import java.util.*;
import java.text.*;
import java.math.*;
import java.util.regex.*;

public class Solution {

    static long maximumPeople(long[] p, long[] x, long[] y, long[] r) {
        long max=0;
        long totpop=0;
        for(int i=0;i<x.length;i++)  {  
            totpop+=p[i];
            if(max<x[i]) max=x[i];
        }
        long loc[]=new long[(int)max+1];
        boolean bool[]=new boolean[(int)max+1];
        
        for(int i=0;i<x.length;i++)
        {
            loc[(int)x[i]]=p[i];
        }
        long maxpop=0;
        for(int i=0;i<y.length;i++)
        {
            int cloudloc=(int)y[i];
            int cloudrange=(int)r[i];
            long pop=0;
            int l=cloudloc;
            int times=cloudrange;
            while(l>=0 && times>0)
            {
                pop+=loc[l];
                l--;
                times--;
            }
            int rr= (int)cloudloc; 
             times=(int)cloudrange;
            while(rr<loc.length && times>0)
            { 
                pop+=loc[rr];
                rr++;
                times--;
            }
            pop-=loc[(int)cloudloc];
            if(maxpop<pop) maxpop=pop;
        }
        
        return (totpop-maxpop);
    }

    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        int n = in.nextInt();
        long[] p = new long[n];
        for(int p_i = 0; p_i < n; p_i++){
            p[p_i] = in.nextLong();
        }
        long[] x = new long[n];
        for(int x_i = 0; x_i < n; x_i++){
            x[x_i] = in.nextLong();
        }
        int m = in.nextInt();
        long[] y = new long[m];
        for(int y_i = 0; y_i < m; y_i++){
            y[y_i] = in.nextLong();
        }
        long[] r = new long[m];
        for(int r_i = 0; r_i < m; r_i++){
            r[r_i] = in.nextLong();
        }
        long result = maximumPeople(p, x, y, r);
        System.out.println(result);
        in.close();
    }
}