// C++ 14
#include <iostream>
#include <string>
#include <vector>
#include <list>
#include <algorithm>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <unordered_map>
#include <math.h>

#define ll long long
#define Int ll
#define loop(__x, __start, __end) for(Int __x = __start; __x < __end; __x++)
#define loopdown(__x, __start, __end) for(Int __x = __start; __x > __end; __x--)
#define rep(__n) for(Int __x = 0; __x < __n; __x++)
#define span(__a,__x,__y) __a.begin()+__x,__a.begin()+__y
#define span_all(__a) __a.begin(),__a.end()
#define len(__x) (__x.size())
#define last(__x) (__x[__x.size()-1])

using namespace std;

struct Point {
  Int x, y;
  Point(Int x, Int y): x(x), y(y) {}
  Point(): x(0), y(0) {}

  bool operator< (const Point &p1) {
    return x < p1.x && y < p1.y;
  }
};
ostream & operator << (ostream & out, Point const & v) {
  out << "Point(" << v.x << ", " << v.y << ')';
  return out;
}

istream & operator >> (istream & in, Point & v) {
  Int x, y;
  in >> x; in >> y; v.x = x; v.y = y;
  return in;
}

// Geometry

#define EPS 0.0000000001

class Vector2 {
public:
  double x, y;
  
  Vector2(double x = 0, double y = 0): x(x), y(y) {}
  
  Vector2 operator + (Vector2 v) { return Vector2(x + v.x, y + v.y); }
  Vector2 operator - (Vector2 v) { return Vector2(x - v.x, y - v.y); }
  Vector2 operator * (double k) { return Vector2(x * k, y * k); }
  Vector2 operator / (double k) { return Vector2(x / k, y / k); }
  
  double length() { return sqrt(norm()); }
  double norm() { return x * x + y * y; }
  double dot (Vector2 v) { return x * v.x + y * v.y; }
  double cross (Vector2 v) { return x * v.y - y * v.x; }
  
  bool operator < (const Vector2 &v) const {
    return x != v.x ? x < v.x : y < v.y;
  }
  
  bool operator == (const Vector2 &v) const {
    return fabs(x - v.x) < EPS && fabs(y - v.y) < EPS;
  }
};

ostream & operator << (ostream & out, Vector2 const & v) { 
  out<< "Vector2(" << v.x << ", " << v.y << ')';
  return out;
}

istream & operator >> (istream & in, Vector2 & v) { 
  double x, y;
  in >> x;
  in >> y;
  v.x = x;
  v.y = y;
  return in;
}

struct Phrase {
  Int l, p;

  bool operator < (const Phrase &other) const {
    return (l == other.l) ? p < other.p : l < other.l;
  }
};

#define MAX_W 394
#define MAX_N 394
Int N, M;

vector<Phrase> phrases_;
vector<Phrase> phrases;
vector<Int> melos;


void input() {
  Int s, l, p;
  Phrase ph;
  cin >> N;
  rep(N) {
    cin >> s >> l >> p;
    loop(x,s,l+1) {
      ph.l = x, ph.p = p;
      phrases_.push_back(ph);
    }
  }
  cin >> M;
  rep(M) {
    cin >> s;
    melos.push_back(s);
  }

  sort(span_all(phrases_));
  reverse(span_all(phrases_));
  Int prev_l = -1;
  for (auto ph: phrases_) {
    if (prev_l == ph.l) continue;
    phrases.push_back(ph);
    prev_l = ph.l;
  }
  N = phrases.size();

  phrases_.clear();
}

vector<vector<Int> > dp(MAX_N, vector<Int>(MAX_W, -1));

Int dfs(Int n, Int cap) {
  if (n == N || cap == 0) return 0;
  if (dp.at(n).at(cap) >= 0) return dp.at(n).at(cap);
  Int val = dfs(n + 1, cap);
  Phrase ph = phrases.at(n);
  if (cap >= ph.l) {
    val = max(
      val,
      max(
        ph.p + dfs(n + 1, cap - ph.l),
        ph.p + dfs(n, cap - ph.l)
      )
    );
  }
  dp.at(n).at(cap) = val;
  return val;
}

void solve() {
  vector<Int> ans;
  for (auto melo: melos) {
    loop(i,0,MAX_N) loop(j,0,MAX_W) dp.at(i).at(j) = -1;
    Int score = dfs(0, melo);
    if (score == 0) {
      cout << -1 << endl;
      return;
    }
    ans.push_back(score);
  }

  for (auto a: ans) cout << a << endl;
}

int main() {
  input();
  solve();
  return 0;
}



Measured memory_bytes: 8116