#include <bits/stdc++.h>
using namespace std;
int main () {
    int N;
    cin >> N;
    std::vector<tuple<int, int, int>> A(N);
    for (auto& [a, b, c] : A) {
        cin >> a >> b >> c;
    }
    int Q;
    cin >> Q;
    vector<int> X(Q);
    for (auto& a : X) {
        cin >> a;
    }
    vector<vector<pair<int, int>>> Y(Q + 1);
    for (auto [l, r, a] : A) {
        if (a >= N) {
            continue;
        }
        int il = lower_bound(X.begin(), X.end(), l) - X.begin();
        Y[il].emplace_back(1, a);
        int ir = upper_bound(X.begin(), X.end(), r) - X.begin();
        Y[ir].emplace_back(-1, a);
    }
    map<int, int> mp;
    set<int> st;
    for (int i = 0; i <= N; i ++) {
        st.insert(i);
    }
    for (int i = 0; i < Q; i ++) {
        for (auto [p, a] : Y[i]) {
            mp[a] += p;
            if (mp[a] == 0) {
                st.insert(a);
            } else if (p > 0 && mp[a] == 1) {
                st.erase(a);
            }
        }
        cout << *(st.begin()) << endl;
    }
}