#include <bits/stdc++.h>
using namespace std;
 
#define fi first
#define se second
#define pb push_back
using vi = vector <int>;
using ll = long long;
using vl = vector <ll>;
using pii = pair <int, int>;
const ll mod = 998244353;
//~ const ll mod = 1e9 + 7;
ll qpow(ll a, ll b, ll m = mod) { ll r = 1, t = a;
	for(; b; b /= 2) { if(b & 1) r = r * t % m; t = t * t % m; } return r; }

const int N = 2e5 + 11;

struct event {
	int x, a, type;
	bool operator <(const event &o) const {
		return x < o.x;
	}
};

int main() {
	ios::sync_with_stdio(0);
	int n; cin >> n;
	
	vector <event> es;
	for(int i = 1; i <= n; i ++) {
		int l, r, a;
		cin >> l >> r >> a;
		
		if(a <= n) {
			es.pb({l, a, 1});
			es.pb({r + 1, a, -1});
		}
	}
	sort(es.begin(), es.end());
	
	map <int, int> cnt;
	bitset <N> bs; bs.set();
	
	int p = 0;
	int q; cin >> q;
	while(q --) {
		int x; cin >> x;
		while(p < es.size() && es[p].x <= x) {
			auto e = es[p];
			if(e.type == 1) {
				cnt[e.a] ++;
				bs[e.a] = 0;
			} else {
				cnt[e.a] --;
				if(cnt[e.a] == 0)
					bs[e.a] = 1;
			}
			p ++;
		}
		cout << bs._Find_first() << '\n';
	}
}