#include <iostream>
#include <vector>
#include <cmath>
#include <map>
#include <set>
#include <iomanip>
#include <queue>
#include <algorithm>
#include <numeric>
#include <deque>
#include <complex>
#include <cassert>

using namespace std;
using ll = long long;

int main(){

    ll N, Q, l, r, a, x;
    cin >> N;
    vector<tuple<ll, ll, ll>> query;

    for (int i=0; i<N; i++){
        cin >> l >> r >> a;
        if (a > N) continue;
        query.push_back({l, 1, a});
        query.push_back({r, 3, a});
    }
    cin >> Q;
    for (int i=0; i<Q; i++){
        cin >> x;
        query.push_back({x, 2, i});
    }

    vector<ll> cnt(N+1), ans(Q);
    set<ll> st;

    for (int i=0; i<=N; i++) st.insert(i);

    sort(query.begin(), query.end());

    for (auto [e, t, x] : query){
        if (t == 1){
            st.erase(x);
            cnt[x]++;
        }
        else if (t == 2){
            ans[x] = *st.begin();
        }
        else{
            if (cnt[x] == 1) st.insert(x);
            cnt[x]--;
        }
    }

    for (int i=0; i<Q; i++) cout << ans[i] << endl;

    return 0;
}