#include<bits/stdc++.h>
namespace {
#pragma GCC diagnostic ignored "-Wunused-function"
#include<atcoder/all>
#pragma GCC diagnostic warning "-Wunused-function"
using namespace std;
using namespace atcoder;
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define rrep(i,n) for(int i = (int)(n) - 1; i >= 0; i--)
#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
template<class T> bool chmax(T& a, const T& b) { if (a < b) { a = b; return true; } else return false; }
template<class T> bool chmin(T& a, const T& b) { if (b < a) { a = b; return true; } else return false; }
using ll = long long;
using P = pair<int,int>;
using VI = vector<int>;
using VVI = vector<VI>;
using VL = vector<ll>;
using VVL = vector<VL>;

template <class S>
struct value_compression : vector<S> {
  bool built = false;
  using VS = vector<S>;
  using VS::VS;
  value_compression(vector<S> v) : vector<S>(move(v)) {}
  void build() {
    sort(this->begin(), this->end());
    this->erase(unique(this->begin(), this->end()), this->end());
    built = true;
  }
  template <class T>
  void convert(T first, T last) {
    assert(built);
    for (; first != last; ++first) *first = (*this)(*first);
  }
  int operator()(S x) {
    assert(built);
    return lower_bound(this->begin(), this->end(), x) - this->begin();
  }
  void clear() {
    this->clear();
    built = false;
  }
};

int op(int x, int y) { return min(x, y); }
int e() { return 1001001001; }

} int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  int n;
  cin >> n;
  value_compression<int> vc;
  vector<tuple<int, int, int>> lra(n);
  for(auto& [l, r, a]: lra) {
    cin >> l >> r >> a, l--;
    vc.emplace_back(l);
    vc.emplace_back(r);
  }
  int q;
  cin >> q;
  VI x(q);
  for(auto& xi: x) {
    cin >> xi, xi--;
    vc.emplace_back(xi);
  }
  vc.build();
  vector<vector<P>> evs(vc.size());
  for(auto& [l, r, a]: lra) if (a < n) {
    l = vc(l);
    r = vc(r);
    evs[l].emplace_back(a, 1);
    evs[r].emplace_back(a, -1);
  }
  segtree<int, op, e> seg(VI(n, 0));
  VI res(vc.size());
  rep(i, vc.size()) {
    for(auto [x, add]: evs[i]) {
      seg.set(x, seg.get(x) + add);
    }
    res[i] = seg.max_right(0, [](int x) { return x > 0; });
  }
  for(int xi: x) cout << res[vc(xi)] << '\n';
}