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,int m) {
// Return the maximum number of people that will be in a sunny town after removing exactly one cloud.
long total=0;
for(int i=0;i
= clmin && x[i]<=clmax)
{
break;
}
else if(j==m-1)
total+=p[i];
}
}
long sun=total;
long large=-1;
for(int i=0;i=clmin && x[j]<=clmax)
{
total = p[i];
}
}
if(total > large)
{
large=total;
}
}
return (sun+large);
}
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,m);
System.out.println(result);
in.close();
}
}