codeforces - 799B

#include <bits/stdc++.h>
using namespace std;
#define rep(i,a,b) for(int i = a;i <= b;++ i)
#define per(i,a,b) for(int i = a;i >= b;-- i)
#define mem(a,b) memset((a),(b),sizeof((a)))
#define FIN freopen("in.txt","r",stdin)
#define IO ios_base::sync_with_stdio(0),cin.tie(0)
#define pb push_back
typedef long long LL;
typedef pair<int, int> PIR;
const int MAXN = 2e5+5;

int n, m, x, a[MAXN], b[MAXN], p[MAXN];
bool vis[MAXN];
vector <int> ans;
struct Node {
    int id, p;
    Node (int _id, int _p)  { id = _id; p = _p; }
    bool operator < (const Node &r) const   { return p > r.p; }
};
priority_queue <Node> vet[5];

int main()
{IO;
    //FIN;
    cin >> n;
    rep(i, 1, n)    cin >> p[i];
    rep(i, 1, n)    cin >> a[i];
    rep(i, 1, n)    cin >> b[i];
    rep(i, 1, n) {
        vet[a[i]].push(Node(i, p[i]));
        vet[b[i]].push(Node(i, p[i]));
    }
    cin >> m;
    rep(i, 1, m) {
        cin >> x;
        if(vet[x].empty())  ans.pb(-1);
        else {
            int ok = 0;
            while(!vet[x].empty()) {
                Node h = vet[x].top(); vet[x].pop();
                if(!vis[h.id]) {
                    ok = 1;
                    ans.pb(p[h.id]);
                    vis[h.id] = true;
                    break;
                }
            }
            if(!ok) ans.pb(-1);
        }
    }
    rep(i, 0, m-1) {
        if(i)   cout << " ";
        cout << ans[i];
    }
    cout << endl;
    return 0;
}