#include <bits/stdc++.h> //sub 2 checking
#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];
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) || (i == N-2)){
if(D > 1) minimize(sub, A[i] - B[i]);
} else minimize(sub, A[i] - B[i]);
}
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
