#include<bits/stdc++.h>
#define REP(i,n) for(int i=0,i##_len=int(n);i<i##_len;++i)
#define rep(i,a,b) for(int i=int(a);i<int(b);++i)
#define All(x) (x).begin(),(x).end()
#define rAll(x) (x).rbegin(),(x).rend()
using namespace std;
using ll = long long;

int main(){
    int n;cin>>n;
    vector<pair<int, pair<int,int>>> op(n);
    REP(i,n){
        int l, r,a;
        cin>>l>>r>>a;
        op[i] = {a, {l, r}};
    } 
    sort(All(op));
    // 数iを含む区間[l,r]の範囲
    vector<vector<pair<int,int>>> dp(n);
    for(auto p:op){
        int a = p.first;
        pair<int,int> range = p.second;
        int l = range.first;
        int r = range.second;
        if(a >= n) {
            // どうせn以上のaは意味がない
            break;
        }
        if(a == 0) {
            dp[0].push_back(range);
        }
        else{
            for(auto prev_range: dp[a-1]){
                int nl = max(l, prev_range.first);
                int nr = min(r, prev_range.second);
                if(nl <= nr) {
                    dp[a].push_back({nl, nr});
                }
            }
        }
    }
    int q;cin>>q;
    REP(_,q){
        int x;cin>>x;
        // (l, r]の区間はSxに含まれない
        int l = -1, r = n;
        while(l+1 < r){
            int mid = (l+r) >> 1;
            bool inc = false;
            for(auto range:dp[mid]) {
                if(range.first <= x && x <= range.second) {
                    inc = true;
                    l = mid;
                    break;
                }
            }
            if(!inc) r = mid;
        }
        cout << r << "\n";
    }
}