#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int,int>;
using T = tuple<int,int,int>;
#define fix(x) fixed << setprecision(x)
#define asc(x) x, vector<x>, greater<x>
#define rep(i, n) for(ll i = 0; i < n; i++)
#define all(x) (x).begin(),(x).end()
template<class T>bool chmin(T&a, const T&b){if(a>b){a=b;return 1;}return 0;}
template<class T>bool chmax(T&a, const T&b){if(a<b){a=b;return 1;}return 0;}
constexpr ll INFLL = (1LL << 62), MOD = 998244353;
constexpr int INF = (1 << 30);
template <typename T>
struct BIT{
    int n;
    vector<T> data;
    BIT(int n=0) : n(n), data(n+1){}
    T sum(int i){
        T res = 0;
        for(; i; i -= i&-i){
            res += data[i];
        }
        return res;
    }
    void add(int i, T x){
        for(; i <= n; i += i&-i){
            data[i] += x;
        }
    }
    int lower_bound(T w){
        int x = 0, r = 1;
        while(r < n) r <<= 1;
        for(int len = r; len > 0; len = len >> 1){
            if(x+len < n && data[x+len] < w){
                w -= data[x+len];
                x += len;
            }
        }
        return x+1;
    }
};
int main(){
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    int n,q;
    cin >> n;
    priority_queue<asc(T)> pq1;
    priority_queue<asc(P)> pq2;
    rep(i,n){
        int l,r,a;
        cin >> l >> r >> a;
        r++;
        a++;
        if(a<=n) pq1.push({l,r,a});
    }
    vector<int> cnt(n+1,0);
    BIT<int> bit(n+1);
    cin >> q;
    rep(i,q){
        int x;
        cin >> x;
        while(pq1.size() && get<0>(pq1.top())<=x){
            int l,r,a;
            tie(l,r,a) = pq1.top();
            pq1.pop();
            pq2.push({r,a});
            if(!cnt[a]) bit.add(a,1);
            cnt[a]++;
        }
        while(pq2.size() && pq2.top().first<=x){
            int r,a;
            tie(r,a) = pq2.top();
            pq2.pop();
            if(cnt[a]==1) bit.add(a,-1);
            cnt[a]--;
        }
        int ok = 0, ng = n+1;
        while(ng-ok>1){
            int md = (ok + ng) / 2;
            if(bit.sum(md)==md) ok = md;
            else ng = md;
        }
        cout << ok << '\n';
    }
    return 0;
}