// Problem: No.2220 Range Insert & Point Mex
// Contest: yukicoder
// URL: https://yukicoder.me/problems/no/2220
// Memory Limit: 512 MB
// Time Limit: 2000 ms

#include <bits/stdc++.h>

#define fastio ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
#define dbg(x) cout << #x << " = " << (x) << "\n";
#define popcount(x) __builtin_popcountll((x))
#define all(v) (v).begin(), (v).end()
#define pb emplace_back
#define x first
#define y second

using namespace std;
typedef long long ll;
typedef pair<ll, ll> pll;

const int inf = 0x3f3f3f3f;
const int mod = 1e9 + 7;

const int N = 1e5 + 7;
int n, q;

void solve() {
  cin >> n;
  vector<array<int, 3>> event;
  for (int i = 0; i < n; i++) {
    array<int, 3> arr{};
    for (int j = 0; j < 3; j++) {
      cin >> arr[j];
    }
    event.push_back({arr[0], 1, arr[2]});
    event.push_back({arr[1], 3, arr[2]});
  }
  cin >> q;
  vector<int> Q(q);
  for (int &i : Q) {
    cin >> i;
    event.push_back({i, 2, 0});
  }
  sort(all(event));
  set<int> mex;
  map<int, int> cnt, ans;
  for (int i = 0; i < N; i++) mex.insert(i);
  for (auto &[pos, op, val] : event) {
    if (op == 1) {
      if (cnt[val]++ == 0) {
        auto it = mex.find(val);
        if (it != mex.end()) mex.erase(it);
      }
    } else if (op == 3) {
      if (cnt[val]-- == 1) {
        mex.insert(val);
      }
    } else {
      ans[pos] = *mex.begin();
    }
  }
  for (int &i : Q) {
    cout << ans[i] << "\n";
  }
}

int main() {
  fastio;
  int t = 1;
  while (t--) {
    solve();
  }
  return 0;
}