#include <bits/stdc++.h>
#define be(v) (v).begin(),(v).end()
#define pb(q) push_back(q)
#define rep(i, n) for(int i=0;i<n;i++)
#define all(i, v) for(auto& i : v)
typedef long long ll;
using namespace std;
const ll mod=1000000007, INF=(1LL<<60);
#define doublecout(a) cout<<fixed<<setprecision(10)<<a<<endl;

struct SegmentTree {
private:
    ll n;
    vector<ll> node;
    ll ID = INF; // min -> INF, max, sum -> 0
    inline ll func(ll a, ll b){return min(a, b);} /////////

public:
    SegmentTree(vector<ll> v) {
        int sz = v.size();
        n = 1; while(n < sz) n *= 2;
        node.resize(2*n-1, ID);
        for(int i=0; i<sz; i++) node[i+n-1] = v[i];
        for(int i=n-2; i>=0; i--) node[i] = func(node[2*i+1], node[2*i+2]);
    }

    void add(ll x, ll val) {
        x += (n - 1);
        node[x] += val;
        while(x > 0) {
            x = (x - 1) / 2;
            node[x] = func(node[2*x+1], node[2*x+2]);
        }
    }

    ll get(ll a, ll b, ll k=0, ll l=0, ll r=-1) {
        if(r < 0) r = n;
        if(r <= a || b <= l) return ID;
        if(a <= l && r <= b) return node[k];

        ll vl = get(a, b, 2*k+1, l, (l+r)/2);
        ll vr = get(a, b, 2*k+2, (l+r)/2, r);
        return func(vl, vr);
    }
};


int main() {
    cin.tie(0);
    cout.tie(0);
    ios::sync_with_stdio(false);
    ll n;
    cin >> n;
    vector<tuple<ll, ll, ll>> event;
    ll l, r, x;

    SegmentTree seg(vector<ll> (200001, 0LL));
    rep(i, n) {
        cin >> l >> r >> x;
        event.push_back({l, x, 1});
        event.push_back({r + 1, x, -1});
    }
    sort(be(event));
    ll q;
    cin >> q;
    ll id = 0;
    rep(i, q) {
        cin >> x;
        while(id < n * 2) {
            auto [z, a, f] = event[id];
            if(a >= 200001) {
                id++;
                continue;
            }
            if(z > x) break;
            seg.add(a, f);
            id++;
        }
        ll le = -1, ri = 200001; 
        while(ri - le > 1) {
            ll mid = (le + ri) / 2;
            if(seg.get(0, mid) == 0) ri = mid;
            else le = mid;
        }
        cout << le << endl;
    }

    return 0;
}