#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], rmq[20][MAX];
set<pi> changes;
void processRMQ(){
FOR(i, 0, N) rmq[0][i] = A[i] - B[i];
for(int i = 1; (1 << i) <= N; ++i){
for(int j = 0; j + (1 << i) <= N; ++j){
rmq[i][j] = min(rmq[i-1][j], rmq[i-1][j + (1 << (i-1))]);
}
}
}
int query_rmq(int l, int r){
int k = 31 - __builtin_clz(r - l + 1);
return min(rmq[k][l], rmq[k][r - (1 << k) + 1]);
}
int min_except(int l, int r){
int res = min(A[l] - B[l], A[r] - B[r]);
if(l+2 <= r-2) minimize(res, query_rmq(l+2, r-2));
return res;
}
namespace DSU{
int lab[MAX], l[MAX], r[MAX], take_at_limit[MAX];
ll sumB[MAX], result;
multiset<pi> values[MAX];
void init(int N){
FOR(i, 0, N) {
lab[i] = -1;
l[i] = r[i] = i;
sumB[i] = B[i];
result += A[i];
take_at_limit[i] = 0;
}
}
ll calc(int u, bool process_change_later = false){
///imagine we have x x x x ... x x x can be paired consecutively
///if sz(x) is even -> answer = sum B[i]
///if sz(x) is odd --> answer = sum B[i] - min(A[i] - B[i])
///- special case 1 : W[l] cannot connect to W[l+2] -> A[l] - B[l] + A[l+1] - B[l+1]
///- special case 2 : W[r] cannot connect to W[r-2] -> A[r] - B[r] + A[r-1] - B[r-1]
// cout << dbg(l[u]) << dbg(r[u]) << dbg(limit);
if((-lab[u]) & 1 ^ 1) return sumB[u];
if((-lab[u]) == 1) return A[u];
ll cur = sumB[u] + min_except(l[u], r[u]);
if(W[l[u]+2] - W[l[u]] <= take_at_limit[u]) {
minimize(cur, sumB[u] + A[l[u]+1] - B[l[u]+1]);
} else if(process_change_later){
changes.insert({u, W[l[u]+2] - W[l[u]]});
}
if(W[r[u]] - W[r[u]-2] <= take_at_limit[u]) {
minimize(cur, sumB[u] + A[r[u]-1] - B[r[u]-1]);
} else if(process_change_later){
changes.insert({u, W[r[u]] - W[r[u]-2]});
}
// cout << dbg(cur) << '\n';
return cur;
}
int root(int u){
return lab[u] < 0 ? u : (lab[u] = root(lab[u]));
}
bool join(int u, int v, int limit){
u = root(u); v = root(v);
if(u == v) return false;
if(lab[u] > lab[v]) swap(u, v);
result -= calc(u);
result -= calc(v);
sumB[u] += sumB[v];
lab[u] += lab[v];
lab[v] = u;
minimize(l[u], l[v]);
maximize(r[u], r[v]);
take_at_limit[u] = limit;
result += calc(u, true);
// cout << dbg(l[u]) << dbg(r[u]) << dbg(calc(u, limit)) << '\n';
return true;
}
void retake(int u, int new_limit){
if(take_at_limit[u] < new_limit){
result -= calc(u);
take_at_limit[u] = new_limit;
result += calc(u, true);
}
}
}
vl calculate_costs(vi _W, vi _A, vi _B, vi E){
N = sz(_W);
int Q = sz(E);
FOR(i, 0, N){
W[i] = _W[i];
A[i] = _A[i];
B[i] = _B[i];
}
ll ss = 0;
vl ans;
FOR(_, 0, Q){
int D = E[_];
if(N & 1 ^ 1) ans.pb(accumulate(all(B), 0ll));
else{
ll s = accumulate(all(B), 0ll);
int sub = INT_MAX;
FOR(i, 0, N){
if(i & 1 ^ 1 || D > 1) minimize(sub, A[i] - B[i]);
}
// cout << dbg(sub) << '\n';
ans.pb(s + sub);
}
}
return ans;
}
#ifdef LOCAL
void setIO(){
ios_base::sync_with_stdio(0); cin.tie(0);
#ifdef LOCAL
freopen("task.inp", "r", stdin);
freopen("task.ans", "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
