#include<bits/stdc++.h>
using namespace std;
const int N = 2e5 + 5;
const long long oo = 1e16;
int n, q, chk1 = 1, chk2 = 1;
long long a[N], b[N], w[N], e[N];
namespace sub1 {
vector<long long> solve() {
vector<long long> ans;
for(int i = 1; i <= q; ++i) {
int D = e[i];
long long res = 0;
for(int i = 1; i <= n; ++i) res += b[i];
if(n & 1) {
long long sub = oo;
for(int i = 1; i <= n; ++i) sub = min(sub, a[i] - b[i]);
res += sub;
}
ans.push_back(res);
}
return ans;
}
}
namespace sub2 {
vector<long long> solve() {
vector<long long> ret, pref(n + 1);
for(int i = 1; i <= n; ++i) pref[i] = pref[i - 1] + b[i];
for(int i = 1; i <= q; ++i) {
int D = e[i], res = oo;
if(D > 1) {
res = pref[n];
if(n & 1) {
long long sub = oo;
for(int i = 1; i <= n; ++i) sub = min(sub, a[i] - b[i]);
res += sub;
}
}
else res = min(pref[n] + a[1] - b[1], pref[n] + a[n] - b[n]);
ret.push_back(res);
}
return ret;
}
}
vector<long long> calculate_costs(
vector<int> W, vector<int> A,
vector<int> B, vector<int> E) {
n = W.size(); q = E.size();
for(int i = 1; i <= n; ++i) {
w[i] = W[i - 1], a[i] = A[i - 1], b[i] = B[i - 1]; e[i] = E[i - 1];
if(w[i] != 1) chk1 = 0;
if(w[i] != i) chk2 = 0;
}
if(chk1) return sub1 :: solve();
if(chk2) return sub2 :: solve();
}
//#define ntc
#ifdef ntc
int32_t main() {
cin.tie(0)->sync_with_stdio(0);
if(fopen("task.inp", "r")) {
freopen("task.inp", "r", stdin);
freopen("task.out", "w", stdout);
}
if(fopen("NILE.inp", "r")) {
freopen("NILE.inp", "r", stdin);
freopen("NILE.out", "w", stdout);
}
vector<int> W, A, B, E;
cin >> n;
for(int i = 1; i <= n; ++i) {
int w, a, b; cin >> w >> a >> b;
W.push_back(w); A.push_back(a); B.push_back(b);
}
cin >> q;
for(int i = 1; i <= q; ++i) {
int D; cin >> D;
E.push_back(D);
}
vector<long long> ans = calculate_costs(W, A, B, E);
for(auto x : ans) cout << x << '\n';
}
#endif
