#include <iostream>
#include <algorithm>
#include <iomanip>
#include <vector>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <tuple>
#include <cmath>
#include <numeric>
#include <functional>
#include <cassert>
#include <atcoder/segtree>

#define debug_value(x) cerr << "line" << __LINE__ << ":<" << __func__ << ">:" << #x << "=" << x << endl;
#define debug(x) cerr << "line" << __LINE__ << ":<" << __func__ << ">:" << x << endl;

template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }

using namespace std;
typedef long long ll;

template<typename T>
vector<vector<T>> vec2d(int n, int m, T v){
    return vector<vector<T>>(n, vector<T>(m, v));
}

template<typename T>
vector<vector<vector<T>>> vec3d(int n, int m, int k, T v){
    return vector<vector<vector<T>>>(n, vector<vector<T>>(m, vector<T>(k, v)));
}

template<typename T>
void print_vector(vector<T> v, char delimiter=' '){
    if(v.empty()) {
        cout << endl;
        return;
    }
    for(int i = 0; i+1 < v.size(); i++) cout << v[i] << delimiter;
    cout << v.back() << endl;
}

template<typename T>
class Compress{
    public:
    vector<T> data;
    int offset;
    Compress(vector<T> data_, int offset=0): offset(offset){
        data = data_;
        sort(begin(data), end(data));
        data.erase(unique(begin(data), end(data)), end(data));
    };
    int operator[](T x) {
        auto p = lower_bound(data.begin(), data.end(), x);
        assert(x == *p);
        return offset+(p-data.begin());
	}
    T inv(int x){
        return data[x-offset];
    }
    int size(){
        return data.size();
    }
};

int op(int x, int y){
    return min(x, y);
}

const int inf = 1e9;

int e(){
    return inf;
}

using Seg = atcoder::segtree<int, op, e>;

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout << setprecision(10) << fixed;
    int n; cin >> n;
    vector<int> l(n), r(n), a(n);
    vector<int> v;
    for(int i = 0; i < n; i++) {
        cin >> l[i] >> r[i] >> a[i]; l[i]--;
        v.push_back(l[i]);
        v.push_back(r[i]);
    }
    int q; cin >> q;
    vector<int> x(q);
    for(int i = 0; i < q; i++){
        cin >> x[i]; x[i]--;
        v.push_back(x[i]);
    }
    auto cp = Compress<int>(v);
    int m = cp.size();
    vector<vector<int>> adds(m);
    vector<vector<int>> dels(m);
    for(int i = 0; i < n; i++){
        if(a[i] >= n) continue;
        adds[cp[l[i]]].push_back(a[i]);
        dels[cp[r[i]]].push_back(a[i]);
    }
    Seg seg(vector<int>(n+1));
    vector<int> mex(m);
    for(int i = 0; i < m; i++){
        for(int x: dels[i]) seg.set(x, seg.get(x)-1);
        for(int x: adds[i]) seg.set(x, seg.get(x)+1);
        auto g = [&](int x){
            return x > 0;
        };
        int r = seg.max_right(0, g);
        mex[i] = r;
    }
    for(int i = 0; i < q; i++) cout << mex[cp[x[i]]] << endl;
}