#include <algorithm>
#include <bitset>
#include <cassert>
#include <chrono>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <string>
#include <vector>
typedef long long ll;
typedef long double ld;
using namespace std;
struct edge
{
int u, v;
ll cuv, cvu, c2;
};
vector<vector<edge> > g;
vector<ll> dps, dp, d, v;
void dfs1a(int u, int p = -1)
{
for (edge e : g[u]) if (e.v != p)
{
dfs1a(e.v, u);
dps[u] += dps[e.v] + e.cvu;
}
}
void dfs1b(int u, int p = -1, ll nad = 0)
{
dp[u] = dps[u] + nad;
for (edge e : g[u]) if (e.v != p)
{
dfs1b(e.v, u, nad + dps[u] - dps[e.v] - e.cvu + e.cuv);
}
}
ll dfs(int u, int p = -1)
{
vector<ll> my;
for (edge e : g[u]) if (e.v != p)
{
my.push_back(dfs(e.v, u) + e.cuv);
}
sort(my.begin(), my.end(), greater<ll>());
for (int i = 1; i < my.size(); i++) v.push_back(my[i]);
if (my.empty()) my.push_back(0);
return my[0];
}
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
g.assign(n, {}), dps.assign(n, 0), dp.assign(n, 0), d.assign(n, 0), v.clear();
ll sum = 0;
for (int i = 0; i < n - 1; i++)
{
edge e;
cin >> e.u >> e.v >> e.cuv >> e.cvu;
e.u--, e.v--, e.c2 = e.cuv + e.cvu;
g[e.u].push_back(e);
swap(e.u, e.v), swap(e.cuv, e.cvu);
g[e.u].push_back(e);
sum += e.c2;
}
dfs1a(0);
dfs1b(0);
vector<ll> ans(n + 1, 0);
ans[1] = *max_element(dp.begin(), dp.end());
bool f = false;
int q;
cin >> q;
while (q--)
{
int x;
cin >> x;
if (x == 1) cout << (sum - ans[x]) << "\n";
else
{
if (!f)
{
for (int a = 0; a < n; a++) if (g[a].size() == 1)
{
v.clear();
v.push_back(dfs(a));
sort(v.begin(), v.end(), greater<ll>());
ll s = dp[a];
for (int i = 0; i < v.size(); i++) s += v[i], ans[i + 2] = max(ans[i + 2], s);
}
for (int i = 1; i <= n; i++) ans[i] = max(ans[i], ans[i - 1]);
f = true;
}
cout << (sum - ans[x]) << "\n";
}
}
return 0;
}
