// #include <bits/stdc++.h>
#include <string.h>

#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <chrono>
#include <ciso646>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>

#define For(i, a, b) for (int i = (int)(a); (i) < (int)(b); ++(i))
#define rFor(i, a, b) for (int i = (int)(a)-1; (i) >= (int)(b); --(i))
#define rep(i, n) For(i, 0, n)
#define rrep(i, n) rFor(i, n, 0)
#define fi first
#define se second

#include <atcoder/segtree>

#include <algorithm>
#include <cassert>
#include <vector>

namespace rklib {

template <class T>
bool chmax(T &a, const T &b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}

template <class T>
bool chmin(T &a, const T &b) {
    if (a > b) {
        a = b;
        return true;
    }
    return false;
}

template <class T>
bool chmin_non_negative(T &a, const T &b) {
    if (a < 0 || a > b) {
        a = b;
        return true;
    }
    return false;
}

template <class T>
T div_floor(T a, T b) {
    if (b < 0) a *= -1, b *= -1;
    return a >= 0 ? a / b : (a + 1) / b - 1;
}

template <class T>
T div_ceil(T a, T b) {
    if (b < 0) a *= -1, b *= -1;
    return a > 0 ? (a - 1) / b + 1 : a / b;
}

}  // namespace rklib


using namespace std;
using namespace rklib;

using lint = long long;
using pii = pair<int, int>;
using pll = pair<lint, lint>;

int op(int a, int b) { return min(a, b); }

int e() { return INT_MAX; }

bool f(int x) { return x >= 1; }

int main() {
    int n;
    scanf("%d", &n);
    vector<tuple<int, int, int>> ranges(n);
    rep(i, n) {
        int l, r, a;
        scanf("%d%d%d", &l, &r, &a);
        ++r;
        ranges[i] = {l, r, a};
    }
    sort(ranges.begin(), ranges.end());

    int q;
    scanf("%d", &q);
    vector<pii> qs(q);  // (set_id, query_id)
    rep(i, q) {
        int x;
        scanf("%d", &x);
        qs[i] = {x, i};
    }
    sort(qs.begin(), qs.end());

    int ans[q];
    {
        auto ranges_it = ranges.begin();
        priority_queue<pii, vector<pii>, greater<pii>> que;  // (r, a)
        vector<int> init(n + 10, 0);
        atcoder::segtree<int, op, e> st(init);
        for (auto [x, idx] : qs) {
            while (ranges_it != ranges.end() && get<0>(*ranges_it) <= x) {
                auto [l, r, a] = *ranges_it;
                ++ranges_it;
                if (a >= int(init.size())) continue;
                int tmp = st.get(a);
                st.set(a, tmp + 1);
                que.emplace(r, a);
            }
            while (!que.empty() && que.top().fi <= x) {
                auto [r, a] = que.top();
                que.pop();
                int tmp = st.get(a);
                st.set(a, tmp - 1);
            }
            ans[idx] = st.max_right<f>(0);
        }
    }
    rep(i, q) printf("%d\n", ans[i]);
}