#include<bits/stdc++.h>
using namespace std;
using ll=long long;
#define rep(i,n) for(int i=0;i<n;i++)
#define rrep(i,n) for(int i=(n)-1;i>=0;i--)
#define all(v) v.begin(),v.end()
#define rall(v) v.rbegin(),v.rend()
template<class T> bool chmax(T &a, T b){if (a < b){a = b;return true;} else return false;}
template<class T> bool chmin(T &a, T b){if (a > b){a = b;return true;} else return false;}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int n;
    cin>>n;
    vector<tuple<int,int,int>>T;
    vector<int>A(n);
    rep(i,n){
        int l,r;
        cin>>l>>r>>A[i];
        T.push_back(make_tuple(l,-1,i));
        T.push_back(make_tuple(r,1,i));
    }
    int q;
    cin>>q;
    rep(i,q){
        int x;
        cin>>x;
        T.push_back(make_tuple(x,0,i));
    }
    sort(all(T));
    set<int>se;
    rep(i,n+1)se.insert(i);
    vector<int>C(n+1),ans(q);
    for(auto[x,t,i]:T){
        if(t==0){
            ans[i]=*se.begin();
        }else{
            if(A[i]>n)continue;
            if(t==-1){
                if(C[A[i]]==0)se.erase(A[i]);
                C[A[i]]++;
            }else{
                C[A[i]]--;
                if(C[A[i]]==0)se.insert(A[i]);
            }
        }
    }
    rep(i,q)cout<<ans[i]<<"\n";
}