# include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int i = a; i <= (int)b; i++)
#define FORD(i, a, b) for (int i = a; i >= (int)b; i--)
const int MAXN = 2e5 + 5;
const int LG = __lg(MAXN) + 1;
int n, q;
struct Edges
{
int u, v, wa, wb;
} E[MAXN];
vector <int> adj[MAXN];
int h[MAXN], P[MAXN][LG];
void DFS(int u,int p)
{
for(int &v : adj[u]) if(v != p)
{
h[v] = h[u] + 1;
P[v][0] = u;
DFS(v, u);
}
}
int LCA(int u, int v)
{
if(h[u] < h[v]) swap(u, v);
int z = __lg(h[u]);
FORD(s, z, 0) if(h[u] - h[v] >= (1 << s)) u = P[u][s];
if(u == v) return u;
FORD(s, z, 0) if(P[u][s] != P[v][s]) u = P[u][s], v = P[v][s];
return P[u][0];
}
int dist(int u, int v)
{
return h[u] + h[v] - 2 * h[LCA(u, v)];
}
namespace sub1
{
Edges tempE[MAXN];
long long ans[MAXN];
void solve()
{
memset(ans, 0x3f, sizeof ans);
FOR(mask, 0, (1 << n) - 1)
{
FOR(i, 1, n - 1) tempE[i] = E[i];
vector <int> nodes;
FOR(i, 0, n - 1) if((mask >> (i)) & 1) nodes.push_back(i + 1);
for(int &x : nodes)
{
FOR(i, 1, n - 1)
{
int u = tempE[i].u, v = tempE[i].v;
if(dist(u, x) > dist(v, x)) tempE[i].wa = 0;
else if(dist(u, x) < dist(v, x)) tempE[i].wb = 0;
}
}
long long sum = 0;
FOR(i, 1, n - 1) sum+= tempE[i].wa + tempE[i].wb;
ans[__builtin_popcount(mask)] = min(ans[__builtin_popcount(mask)], sum);
}
FOR(i, 1, q)
{
int t; cin >> t;
cout << ans[t] << "\n";
}
}
}
signed main()
{
cin.tie(nullptr) -> sync_with_stdio(false);
#define taskname "kieuoanh"
if(fopen(taskname".inp", "r"))
{
freopen(taskname".inp", "r", stdin);
freopen(taskname".out", "w", stdout);
}
cin >> n;
FOR(i, 1, n - 1)
{
int u, v, wa, wb; cin >> u >> v >> wa >> wb;
adj[u].push_back(v); adj[v].push_back(u);
E[i] = {u, v, wa, wb};
}
DFS(1, 1);
for(int j = 1; (1 << j) <= n; j++) FOR(i, 1, n) P[i][j] = P[P[i][j - 1]][j - 1];
cin >> q;
if(n <= 16) return sub1::solve(), 0;
return 0;
}
