import java.util.ArrayList;
import java.util.HashSet;
import java.util.Scanner;
class Main {
public static void main(String args[]) {
Scanner sc = new Scanner(System.in);
if (sc.hasNext()) {
int n = sc.nextInt();
int i = 0, n1;
while (n != 0) {
ArrayList<Integer> ar = new ArrayList<Integer>();
ArrayList<Integer> ar1 = new ArrayList<Integer>();
for (i = 0; i < n; i++)
ar.add(sc.nextInt());
n1 = sc.nextInt();
for (i = 0; i < n1; i++)
ar1.add(sc.nextInt());
solve(ar, ar1);
n = sc.nextInt();
}
}
}
public static void solve(ArrayList<Integer> ar, ArrayList<Integer> ar1) {
HashSet<Integer> hs = new HashSet<Integer>();
hs.addAll(ar1);
long sum = 0, sum1 = 0, sum2 = 0;
int pos = 0, j = 0, i = 0;
for (i = 0; i < ar.size(); i++) {
if (hs.contains(ar.get(i))) {
for (j = pos; ar1.get(j) <= ar.get(i); j++)
sum1 += ar1.get(j);
sum2 += Math.max(sum1, sum + ar.get(i));
pos = j;
sum = 0;
sum1 = 0;
}
else
sum += ar.get(i);
}
for (j = pos; j < ar1.size(); j++)
sum1 += ar1.get(j);
sum2 += Math.max(sum1, sum);
System.out.println(sum2);
}
}