#include <bits/stdc++.h>
#define int long long
//#pragma GCC optimize("Ofast")
//#pragma comment(linker, "/stack:200000000")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4")
#define file(s) freopen(s".in","r",stdin); freopen(s".out","w",stdout);
#define forev(i, b, a) for(int i = (b); i >= (a); --i)
#define forn(i, a, b) for(int i = (a); i <= (b); ++i)
#define all(x) x.begin(), x.end()
#define sz(s) (int)s.size()
#define pb push_back
#define ppb pop_back
#define mp make_pair
#define s second
#define f first
using namespace std;
typedef pair < long long, long long > pll;
typedef pair < int, int > pii;
typedef unsigned long long ull;
typedef vector < pii > vpii;
typedef vector < int > vi;
typedef long double ldb;
typedef long long ll;
typedef double db;
const int inf = 1e9, maxn = 4e5 + 148, mod = 1e9 + 7, N = 3e5 + 11;
const int dx[] = {1, -1, 0, 0}, dy[] = {0, 0, 1, -1}, block = 555;
const pii base = mp(1171, 3307), Mod = mp(1e9 + 7, 1e9 + 9);
const db eps = 1e-12, pi = 3.14159265359;
const ll INF = 1e18;
int n, q, a, b, c, d, e, sum, sumc, dp[N], res[N], cnt[N], par[N], up[N];
set < pii > Q;
struct edge {
int to, c, d;
edge () {}
edge (int _to, int _c, int _d) {
to = _to;
c = _c;
d = _d;
}
};
vector < edge > g[N];
void dfs (int v, int p = 0) {
par[v] = p;
for (auto x : g[v])
if (x.to == p) {
dp[v] = dp[p] + x.d - x.c;
sumc += x.c;
up[v] = x.d;
} else
dfs(x.to, v);
}
main () {
scanf("%lld", &n);
for (int i = 1; i < n; ++i) {
scanf("%lld%lld%lld%lld", &a, &b, &c, &d);
g[a].pb(edge(b, c, d));
g[b].pb(edge(a, d, c));
sum += c;
sum += d;
++cnt[a], ++cnt[b];
}
int root = 1;
while (sz(g[root]) == 1 && root < n)
++root;
dfs(root);
res[1] = sum - (sumc + *max_element(dp + 1, dp + 1 + n));
for (int i = 1; i <= n; ++i)
if (cnt[i] == 1)
Q.insert({up[i], i});
int cur = 0;
while (sz(Q) > 2) {
int v = Q.begin()->s, u = Q.begin()->f;
cur += u;
Q.erase(Q.begin());
--cnt[par[v]];
if (cnt[par[v]] == 1)
Q.insert({up[par[v]], par[v]});
else
res[sz(Q)] = cur;
}
scanf("%lld", &q);
while (q--) {
scanf("%lld", &e);
printf("%lld\n", res[e]);
}
}
