#include <bits/stdc++.h>
#ifndef LOCAL
#include "nile.h"
#endif // LOCAL
using namespace std;
#define FOR(i, l, r) for(int i = (l); i < (r); ++i)
#define ROF(i, r, l) for(int i = (r)-1; i >= (l); --i)
#define mp make_pair
#define mt make_tuple
#define ff first
#define ss second
#define all(v) begin(v), end(v)
#define rall(v) rbegin(v), rend(v)
#define compact(v) v.erase(unique(all(v)), end(v))
#define sz(v) (int)v.size()
#define pb push_back
#define eb emplace_back
#define dbg(x) "[" #x " = " << (x) << "]"
template<typename T>
bool minimize(T& a, const T& b){
if(a > b) return a = b, true;
return false;
}
template<typename T>
bool maximize(T& a, const T& b){
if(a < b) return a = b, true;
return false;
}
using ll = long long;
using db = double;
using ull = unsigned long long;
using ld = long double;
using pi = pair<int, int>;
using pl = pair<ll, ll>;
using vi = vector<int>;
using vl = vector<ll>;
using vd = vector<db>;
using vc = vector<char>;
using vb = vector<bool>;
using vpi = vector<pi>;
using vpl = vector<pl>;
using vvi = vector<vi>;
using vvl = vector<vl>;
const int MAX = 1e5 + 5;
int N, W[MAX], A[MAX], B[MAX];
ll solve(int L, int R, int C){
if(L > R) return 0;
ll sum = 0;
int stop = R;
FOR(i, L+1, R+1){
if(W[i] - W[i-1] > C){
sum += solve(i, R, C);
stop = i-1;
break;
}
}
FOR(i, L, stop+1) sum += B[i];
if((stop - L + 1) & 1 ^ 1){
return sum;
}
int sub = 2e9;
FOR(i, L, stop+1){
if((i & 1) == (L & 1)) minimize(sub, A[i] - B[i]);
else if(W[i+1] - W[i-1] <= C) minimize(sub, A[i] - B[i]);
}
return sum + sub;
}
vl calculate_costs(vi _W, vi _A, vi _B, vi E){
N = sz(_W);
int Q = sz(E);
vpi queries(Q);
FOR(i, 0, Q) queries[i] = mp(E[i], i);
sort(all(queries));
vector<tuple<int, int, int>> ord;
FOR(i, 0, N) ord.pb(mt(_W[i], _A[i], _B[i]));
sort(all(ord));
FOR(i, 0, N) tie(W[i], A[i], B[i]) = ord[i];
vl ans;
FOR(i, 0, Q){
ans.pb(solve(0, N-1, E[i]));
}
return ans;
}
#ifdef LOCAL
void setIO(){
ios_base::sync_with_stdio(0); cin.tie(0);
#ifdef LOCAL
freopen("task.inp", "r", stdin);
freopen("task.out", "w", stdout);
#endif // LOCAL
}
int main(){
setIO();
int N;
cin >> N;
vi W(N), A(N), B(N);
FOR(i, 0, N) cin >> W[i] >> A[i] >> B[i];
int Q;
cin >> Q;
vi E(Q);
FOR(i, 0, Q) cin >> E[i];
vl costs = calculate_costs(W, A, B, E);
FOR(i, 0, sz(costs)){
cout << costs[i] << '\n';
}
return 0;
}
#endif //LOCAL
