#include <bits/stdc++.h>

using namespace std;
map <long,long> m1;
/*long maximumPeople(vector <long> p, vector <long> x, vector <long> y, vector <long> r) {
    // Return the maximum number of people that will be in a sunny town after removing exactly one cloud.
    if(y.length()==0) { long ans=0; for(long int i=0;i<p.length();i++) ans+=p[i];return ans;}
    long ans;
    for(long i=0;i<y.length();i++)
    {
        //removing ith cloud
        
    }
}*/

int main() {
    int n;
    cin >> n;
    long int totalpop=0;
    vector<long> p(n);
    for(int p_i = 0; p_i < n; p_i++){
       cin >> p[p_i];
        totalpop+=p[p_i];
    }
    vector<long> x(n);
    for(int x_i = 0; x_i < n; x_i++){
       cin >> x[x_i];
        m1.insert(pair <long, long> (p[x_i],x[x_i]));
    }
    int m;
    cin >> m;
    if(m<=1) {cout<<totalpop;return 0;}
    vector<long> y(m);
    for(int y_i = 0; y_i < m; y_i++){
       cin >> y[y_i];
    }
    vector<long> r(m);
    for(int r_i = 0; r_i < m; r_i++){
       cin >> r[r_i];
           
    }
    /*for(long i=0;i<)
    long alreadyhappy=0;
    
    cout << result << endl;
    */return 0;
}