#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define ALL(x) (x).begin(), (x).end()
#ifdef LOCAL
#include "debug.hpp"
#else
#define debug(...) void(0)
#endif

template <typename T> istream& operator>>(istream& is, vector<T>& v) {
    for (T& x : v) is >> x;
    return is;
}
template <typename T> ostream& operator<<(ostream& os, const vector<T>& v) {
    for (size_t i = 0; i < v.size(); i++) {
        os << v[i] << (i + 1 == v.size() ? "" : " ");
    }
    return os;
}

template <typename T> T gcd(T x, T y) { return y != 0 ? gcd(y, x % y) : x; }
template <typename T> T lcm(T x, T y) { return x / gcd(x, y) * y; }

int topbit(signed t) { return t == 0 ? -1 : 31 - __builtin_clz(t); }
int topbit(long long t) { return t == 0 ? -1 : 63 - __builtin_clzll(t); }
int botbit(signed a) { return a == 0 ? 32 : __builtin_ctz(a); }
int botbit(long long a) { return a == 0 ? 64 : __builtin_ctzll(a); }
int popcount(signed t) { return __builtin_popcount(t); }
int popcount(long long t) { return __builtin_popcountll(t); }
bool ispow2(int i) { return i && (i & -i) == i; }
long long MSK(int n) { return (1LL << n) - 1; }

template <class T> T ceil(T x, T y) {
    assert(y >= 1);
    return (x > 0 ? (x + y - 1) / y : x / y);
}
template <class T> T floor(T x, T y) {
    assert(y >= 1);
    return (x > 0 ? x / y : (x - y + 1) / y);
}

template <class T1, class T2> inline bool chmin(T1& a, T2 b) {
    if (a > b) {
        a = b;
        return true;
    }
    return false;
}
template <class T1, class T2> inline bool chmax(T1& a, T2 b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}

template <typename T> void mkuni(vector<T>& v) {
    sort(v.begin(), v.end());
    v.erase(unique(v.begin(), v.end()), v.end());
}
template <typename T> int lwb(const vector<T>& v, const T& x) { return lower_bound(v.begin(), v.end(), x) - v.begin(); }

const int INF = (1 << 30) - 1;
const long long IINF = (1LL << 60) - 1;
const int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};
const int MOD = 998244353;
// const int MOD = 1000000007;

#include "atcoder/fenwicktree"

int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    int N;
    cin >> N;
    vector<int> l(N), r(N), a(N);
    for (int i = 0; i < N; i++) cin >> l[i] >> r[i] >> a[i], l[i]--;
    int Q;
    cin >> Q;
    vector<int> x(Q);
    for (int i = 0; i < Q; i++) cin >> x[i], x[i]--;

    vector<int> cand;
    for (int i = 0; i < N; i++) {
        cand.emplace_back(l[i]);
        cand.emplace_back(r[i]);
    }
    cand.emplace_back(0);
    cand.emplace_back(int(1e9));
    mkuni(cand);
    vector<vector<pair<int, int>>> ranges(N);
    for (int i = 0; i < N; i++) {
        l[i] = lwb(cand, l[i]);
        r[i] = lwb(cand, r[i]);
        if (a[i] >= N) continue;
        ranges[a[i]].emplace_back(l[i], r[i]);
    }
    for (auto& v : ranges) {
        sort(ALL(v));
        vector<pair<int, int>> nv;
        int L = -1, R = -1;
        for (auto p : v) {
            if (L == -1) {
                L = p.first;
                R = p.second;
                continue;
            }
            if (p.first <= R)
                chmax(R, p.second);
            else {
                nv.emplace_back(L, R);
                L = p.first;
                R = p.second;
            }
        }
        if (L != -1) nv.emplace_back(L, R);
        swap(v, nv);
    }
    int sz = cand.size();
    for (int& val : x) val = upper_bound(ALL(cand), val) - cand.begin() - 1;

    vector<int> lb(Q, -1), ub(Q, N);
    while (true) {
        bool finished = true;
        vector<vector<int>> mid(N);
        for (int i = 0; i < Q; i++) {
            if (ub[i] - lb[i] <= 1) continue;
            mid[(ub[i] + lb[i]) >> 1].emplace_back(i);
            finished = false;
        }
        if (finished) break;
        atcoder::fenwick_tree<int> ft(sz);
        for (int i = 0; i < N; i++) {
            for (auto& p : ranges[i]) {
                ft.add(p.first, 1);
                ft.add(p.second, -1);
            }
            for (int& idx : mid[i]) (ft.sum(0, x[idx] + 1) == i + 1 ? lb[idx] : ub[idx]) = i;
        }
    }

    for (int i = 0; i < Q; i++) cout << ub[i] << '\n';
    return 0;
}