#include <stdio.h>
#include <bits/stdc++.h>
#include <atcoder/all>
using namespace atcoder;
using mint = modint998244353;
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define Inf32 1000000001
#define Inf64 1000000000000000001

int main(){
	
	int n;
	cin>>n;
	vector<int> t;
	vector<int> l(n),r(n),a(n);
	rep(i,n){
		cin>>l[i]>>r[i]>>a[i];
		r[i]++;
		t.push_back(l[i]);
		t.push_back(r[i]);
	}
	int q;
	cin>>q;
	vector<int> x(q);
	rep(i,q){
		cin>>x[i];
		t.push_back(x[i]);
	}
	sort(t.begin(),t.end());
	t.erase(unique(t.begin(),t.end()),t.end());
	vector<vector<int>> Add(t.size()),Del(t.size()),Que(t.size());
	rep(i,n){
		l[i] = distance(t.begin(),lower_bound(t.begin(),t.end(),l[i]));
		r[i] = distance(t.begin(),lower_bound(t.begin(),t.end(),r[i]));
		if(a[i]>=5)continue;
		Add[l[i]].push_back(i);
		Del[r[i]].push_back(i);
	}
	rep(i,q){
		x[i] = distance(t.begin(),lower_bound(t.begin(),t.end(),x[i]));
		Que[x[i]].push_back(i);
	}
	set<int> None;
	rep(i,n+5)None.insert(i);
	vector<int> c(n+5,0);
	vector<int> ans(q);
	
	rep(i,t.size()){
		//cout<<i<<endl;
		rep(j,Add[i].size()){
			int xx = a[Add[i][j]];
			c[xx]++;
			if(c[xx]==1)None.erase(xx);
		}
		//cout<<i<<endl;
		rep(j,Del[i].size()){
			int xx = a[Del[i][j]];
			c[xx]--;
			if(c[xx]==0)None.insert(xx);
		}
		//cout<<i<<endl;
		rep(j,Que[i].size()){
			int xx = Que[i][j];
			ans[xx] = *(None.begin());
		}
	}
	rep(i,q){
		cout<<ans[i]<<endl;
	}
	
	return 0;
}