#include <iostream>
#include <vector>
#include <algorithm>
#include <array>
#include <iterator>
#include <string>
#include <cctype>
#include <cstring>
#include <cstdlib>
#include <cassert>
#include <cmath>
#include <ctime>
#include <iomanip>
#include <numeric>
#include <stack>
#include <queue>
#include <map>
#include <unordered_map>
#include <set>
#include <unordered_set>
#include <bitset>
#include <random>
#include <utility>
#include <functional>
using namespace std;
void Main()
{
	int N;
	cin >> N;
	vector<int> L(N),R(N),A(N);
	vector<int> comp;
	for(int i = 0;i < N;i++)
	{
		cin >> L[i] >> R[i] >> A[i];
		L[i]--;
		if(A[i] >= N);
		else
		{
			comp.push_back(L[i]);
			comp.push_back(R[i]);
		}
	}
	int Q;
	cin >> Q;
	vector<int> x(Q);
	for(int i = 0;i < Q;i++)
	{
		cin >> x[i];
		x[i]--;
		comp.push_back(x[i]);
	}
	sort(comp.begin(),comp.end());
	comp.erase(unique(comp.begin(),comp.end()),comp.end());
	vector<vector<pair<int,int>>> G(comp.size());
	vector<vector<int>> Qs(comp.size());
	for(int i = 0;i < N;i++)
	{
		if(A[i] < N)
		{
			int li = lower_bound(comp.begin(),comp.end(),L[i]) - comp.begin();
			int ri = lower_bound(comp.begin(),comp.end(),R[i]) - comp.begin();
			G[li].push_back(make_pair(A[i],1));
			G[ri].push_back(make_pair(A[i],-1));
		}
	}
	for(int i = 0;i < Q;i++)
	{
		int id = lower_bound(comp.begin(),comp.end(),x[i]) - comp.begin();
		Qs[id].push_back(i);
	}
	vector<int> ans(Q);
	set<int> S;
	for(int i = 0;i <= N;i++)
	{
		S.insert(i);
	}
	vector<int> cnt(N);
	for(int i = 0;i < (int)comp.size();i++)
	{
		for(const auto &[a,x] : G[i])
		{
			if(x == 1)
			{
				if(!cnt[a]++)
				{
					S.erase(a);
				}
			}
			else
			{
				if(!--cnt[a])
				{
					S.insert(a);
				}
			}
		}
		for(int qi : Qs[i])
		{
			ans[qi] = *S.begin();
		}
	}
	for(int i = 0;i < Q;i++)
	{
		cout << ans[i] << "\n";
	}
}
int main()
{
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	int tt = 1;
	/* cin >> tt; */
	while(tt--) Main();
}