#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
typedef long long ll;
using namespace __gnu_pbds;
using namespace std;
template <typename T>
using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
ll M = 200'010;
vector<ll> depth(M), only(M), ans(M), is_off(M), pre(M), post(M);
vector<vector<pair<ll, ll>>> g(M);
ll nxt;
void only_dfs(ll v, ll p) {
depth[v] = depth[p] + 1;
for(auto[u,k] : g[v]) {
if(u==p) continue;
only[u] += only[v];
only_dfs(u,v);
}
}
ll n;
vector<ll> par(M), sajz(M);
void sajz_dfs(ll v, ll p) {
sajz[v] = 1;
par[v] = p;
for(auto[u,k] : g[v]) {
if(u==p || is_off[u]) continue;
sajz_dfs(u,v);
sajz[v] += sajz[u];
}
}
ll base = 1<<19;
vector<pair<ll, ll>> T(2*base,{0,0});
vector<ll> L(2*base);
void push(ll v, ll l, ll r) {
if(L[v]==0 || v>=base) return;
for(auto x : {l,r}) {
T[x].first += L[v];
L[x] += L[v];
}
L[v] = 0;
}
void build() {
for(ll i=0; i<base; ++i) T[i+base].second = i;
for(ll i=base-1; i>=1; --i) {
T[i] = max(T[i+i], T[i+i+1]);
}
}
void update(ll v, ll a, ll b, ll p, ll k, ll val) {
if(b < p || k < a) return;
if(p<=a && b<=k) {
T[v].first += val;
L[v] += val;
return;
}
ll l = 2*v; ll r=2*v+1; ll mid=(a+b)/2;
push(v,l,r);
update(l,a,mid,p,k,val);
update(r,mid+1,b,p,k,val);
T[v] = max(T[l], T[r]);
}
pair<ll, ll> query(ll v, ll a, ll b, ll p, ll k) {
if(b < p || k < a) return {0,0};
if(p<=a && b<=k) return T[v];
ll l = 2*v; ll r=2*v+1; ll mid=(a+b)/2;
return max(query(l,a,mid,p,k), query(r,mid+1,b,p,k));
}
vector<ll> V, cost(M), who(2*M);
void pre_dfs(ll v, ll p) {
pre[v] = ++nxt;
for(auto[u,k] : g[v]) {
if(u==p) cost[v] = k;
if(is_off[u] || u==p) continue;
pre_dfs(u,v);
}
post[v] = ++nxt;
V.push_back(v);
who[pre[v]] = who[post[v]] = v;
}
ll find_centroid(ll v, ll ts) {
for(auto[u,k] : g[v]) {
if(is_off[u]) continue;
if(u==par[v]) {
if(ts-sajz[v] > ts/2) return find_centroid(u,ts);
} else {
if(sajz[u] > ts/2) return find_centroid(u,ts);
}
}
return v;
}
void centroid_decomposition(ll v) {
sajz_dfs(v, v);
ll ctr = find_centroid(v,sajz[v]);
sajz_dfs(ctr,ctr);
if(sajz[ctr]==1) {
is_off[ctr] = 1;
return;
}
ll cnt = 0;
ll res = only[ctr];
nxt = -1;
pre_dfs(ctr, ctr);
for(auto x : V) {
update(1,0,base-1,pre[x],post[x],cost[x]);
}
cost[ctr] = 0;
vector<pair<ll, ll>> F = {{0,ctr}};
for(auto[u,k] : g[v]) {
F.push_back(query(1,0,base-1,pre[u],post[u]));
}
sort(F.begin(), F.end());
reverse(F.begin(), F.end());
auto del = [&](ll x) {
x = who[x];
cnt++;
while(cost[x]) {
res += cost[x];
update(1,0,base-1,pre[x],post[x],-cost[x]);
cost[x] = 0;
x = par[x];
}
};
del(F[0].second); del(F[1].second);
ans[cnt] = max(ans[cnt], res);
auto[val,idx] = query(1,0,base-1,0,nxt);
while(val > 0) {
del(idx);
ans[cnt] = max(ans[cnt], res);
pair<ll, ll> para = query(1,0,base-1,0,nxt);
val = para.first; idx = para.second;
}
for(auto x : V) {
who[pre[v]] = who[post[v]] = 0;
cost[x] = pre[v] = post[v] = par[v] = sajz[v] = 0;
}
while(V.size()) V.pop_back();
is_off[ctr] = 1;
for(auto[u,k] : g[ctr]) if(!is_off[u]) centroid_decomposition(u);
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
cin >> n;
ll sum = 0;
vector<pair<pair<ll, ll>, pair<ll, ll>>> edges;
for(ll i=1; i<n; ++i) {
ll a,b,c,d;
cin >> a >> b >> c >> d;
swap(c,d);
g[a].push_back({b,c});
g[b].push_back({a,d});
edges.push_back({{a,c},{b,d}});
sum += c + d;
}
build();
ll added = 0;
only_dfs(1,0);
for(auto[x,y] : edges) {
if(depth[y.first] > depth[x.first]) swap(x,y);
auto[a,c] = x;
auto[b,d] = y;
only[a] += c-d;
added += d;
}
only_dfs(1,0);
for(ll i=1; i<=n; ++i) {
only[i] += added;
ans[1] = max(ans[1], only[i]);
}
centroid_decomposition(1);
for(ll i=2; i<=n; ++i) ans[i] = max(ans[i], ans[i-1]);
ll q; cin >> q;
while(q--) {
ll x; cin >> x;
cout << sum - ans[x] << "\n";
}
return 0;
}
