#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pll = pair<ll, ll>;
#define drep(i, cc, n) for (ll i = (cc); i <= (n); ++i)
#define rep(i, n) drep(i, 0, n - 1)
#define all(a) (a).begin(), (a).end()
#define pb push_back
#define fi first
#define se second

const ll MOD = 1000000007;
const ll MOD2 = 998244353;
const ll INF = 1LL << 60;
const ll MAX_N = 2e5;

int main(){
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    
    int n; cin >> n;
    priority_queue<tuple<int, int, int>, vector<tuple<int, int, int>>, greater<tuple<int, int, int>>> PQ;
    for(int i=0; i<n; i++){
        int l, r, a;
        cin >> l >> r >> a;
        l--; r--;
        PQ.push({l, 0, a});
        PQ.push({r, 2, a});
    }

    int q;
    cin >> q;
    for(int i=0; i<q; i++){
        int x; cin >> x;
        x--;
        PQ.push({x, 1, i});
    }

    vector<int> ans(q);
    vector<int> cnt(n, 0);
    set<int> st; rep(i, n) st.insert(i);
    while(!PQ.empty()){
        int t = get<1>(PQ.top());
        if(t==0){
            int a = get<2>(PQ.top());
            if(a<n){
                st.erase(a);
                cnt[a]++;
            }
        }else if(t==1){
            int idx = get<2>(PQ.top());
            if((int)st.size()==0) ans[idx]=n;
            else ans[idx]=*st.begin();
        }else if(t==2){
            int a = get<2>(PQ.top());
            if(a<n){
                cnt[a]--;
                if(cnt[a]==0) st.insert(a);
            }
        }

        PQ.pop();
    }

    for(int i=0; i<q; i++) cout << ans[i] << "\n";
}