#include<bits/stdc++.h>
#include<atcoder/all>
using namespace std;
using namespace atcoder;
typedef long long int ll;
typedef long double ld;
typedef vector<ll> vi;
typedef vector<vi> vvi;
typedef vector<vvi> vvvi;
typedef vector<vvvi> vvvvi;
typedef pair<ll,ll> pi;
typedef pair<ll,pi> ppi;
typedef pair<ll,ppi> pppi;
typedef pair<ll,pppi> ppppi;
#define FOR(i,l,r) for(ll i=l;i<r;i++)
#define REP(i,n) FOR(i,0,n)
#define RFOR(i,l,r) for(ll i=r-1;i>=l;i--)
#define RREP(i,n) RFOR(i,0,n)
#define ALL(x) x.begin(),x.end()
#define F first
#define S second
#define BS(A,x) binary_search(ALL(A),x)
#define LB(A,x) (ll)(lower_bound(ALL(A),x)-A.begin())
#define UB(A,x) (ll)(upper_bound(ALL(A),x)-A.begin())
#define COU(A,x) (UB(A,x)-LB(A,x))
#define sz(c) ((ll)(c).size())
template<typename T>using min_priority_queue=priority_queue<T,vector<T>,greater<T>>;
template<typename T1,typename T2>ostream&operator<<(ostream&os,pair<T1,T2>&p){os<<p.F<<" "<<p.S;return os;}
template<typename T1,typename T2>istream&operator>>(istream&is,pair<T1,T2>&p){is>>p.F>>p.S;return is;}
template<typename T>ostream&operator<<(ostream&os,vector<T>&v){REP(i,sz(v))os<<v[i]<<(i+1!=sz(v)?" ":"");return os;}
template<typename T>istream&operator>>(istream&is,vector<T>&v){for(T&in:v)is>>in;return is;}
template<class T>bool chmax(T&a,T b){if(a<b){a=b;return 1;}return 0;}
template<class T>bool chmin(T&a,T b){if(b<a){a=b;return 1;}return 0;}
ld dist(ld x1,ld y1,ld x2,ld y2){return sqrtl((x1-x2)*(x1-x2)+(y1-y2)*(y1-y2));}
//*
using mint=modint998244353;
const ll mod=998244353;
//*/
/*
using mint=modint1000000007;
const ll mod=1000000007;
//*/
//using mint=modint;
//*
typedef vector<mint> vm;
typedef vector<vm> vvm;
typedef vector<vvm> vvvm;
typedef vector<vvvm> vvvvm;
ostream&operator<<(ostream&os,mint&a){os<<a.val();return os;}
//*/

ll op(ll a,ll b){return max(a,b);}
ll e(){return 0;}
ll ma(ll f,ll x){return f+x;}
ll co(ll f,ll g){return f+g;}
ll id(){return 0;}
int main(){
  ll N;cin>>N;
  vector<vector<pi>>E(2e5);
  REP(i,N){
      ll l,r,a;cin>>l>>r>>a;
      if(a<2e5)E[a].emplace_back(pi(l,r+1));
  }
  ll Q;cin>>Q;
  vi X(Q);cin>>X;
  REP(i,2e5){
      for(auto&p:E[i]){
          p.F=LB(X,p.F);
          p.S=LB(X,p.S);
      }
      sort(ALL(E[i]));
      vector<pi>F;
      REP(j,sz(E[i])){
          ll r=E[i][j].S,l=E[i][j].F;
          while(j<sz(E[i])&&E[i][j].F<=r){chmax(r,E[i][j].S);j++;}
          F.emplace_back(pi(l,r));j--;
      }
      E[i]=F;
  }
  vi L(Q,-1),R(Q,1.5e5);
  REP(_,30){
      vvi T(2e5);
      REP(i,Q)T[(L[i]+R[i])/2].emplace_back(i);
      lazy_segtree<ll,op,e,ll,ma,co,id>F(Q);
      REP(i,2e5){
          for(auto p:E[i])F.apply(p.F,p.S,1);
          for(auto j:T[i]){
              if(F.get(j)==i+1)L[j]=i;
              else R[j]=i;
          }
      }
  }
  REP(i,Q)cout<<R[i]<<endl;
  return 0;
}