#include <bits/stdc++.h>
using namespace std;
#define all(v) v.begin(),v.end()
#define pb push_back
#define ll long long
#define ld long double
#define fi first
#define se second
#define mk make_pair
typedef pair<int,int> pii;
struct Edge
{
int u,v;
int w[2];
int find_node(int i) { return (i==u?v:u);}
bool find_dir(int i) { return (i==u?0:1);}
Edge(int _u,int _v,int _r,int _l) : u(_u),v(_v)
{
w[0] = _r;
w[1] = _l;
}
};
const int maxn = 2e5 + 10;
vector<int> adj[maxn];
vector<Edge>edges;
ll TOTAL,ans[maxn],c[maxn],sub[maxn];
int s[maxn];
int n;
void prep(int i,int pa)
{
for(int id : adj[i])
{
int k = edges[id].find_node(i);
if(k==pa)continue;
bool dir = edges[id].find_dir(i);
prep(k,i);
sub[i] += sub[k] + edges[id].w[dir^1];
}
}
ll mx, root;
void cal(int i,int pa,ll carry,ll dis)
{
c[i] = carry;
carry += sub[i];
if(dis > mx)
{
mx = dis;
root = i;
}
for(int id : adj[i])
{
int k = edges[id].find_node(i);
if(k==pa)continue;
bool dir = edges[id].find_dir(i);
cal(k,i,carry - edges[id].w[dir^1] + edges[id].w[dir] - sub[k],dis + edges[id].w[dir] /*+ edges[id].w[dir^1]*/);
}
}
int heavy[maxn];
ll dfs(int i,int pa)
{
sub[i]=0;
ll mx = 0;
for(int id : adj[i])
{
int k = edges[id].find_node(i);
if(k==pa)continue;
bool dir = edges[id].find_dir(i);
ll tmp = edges[id].w[dir] + dfs(k,i);
sub[i] += sub[k] + edges[id].w[dir^1];
if(tmp > mx)
{
mx = tmp;
heavy[i] = k;
}
}
return mx;
}
vector<ll> vs;
void decompose(int i,int pa,ll dis)
{
if(adj[i].size()==1) vs.pb(dis);
for(int id : adj[i])
{
int k = edges[id].find_node(i);
if(k==pa)continue;
bool dir = edges[id].find_dir(i);
ans[1] += edges[id].w[dir^1];
if(k==heavy[i])
{
decompose(k,i,dis + edges[id].w[dir]);
}
else
{
decompose(k,i,edges[id].w[dir]);
}
}
}
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(0);
cin>>n;
for(int i = 1,u,v,r,l;i<n;i++)
{
cin>>u>>v>>r>>l;
adj[u].pb(edges.size());
adj[v].pb(edges.size());
edges.emplace_back(u,v,r,l);
TOTAL += r + l;
}
prep(1,0);
cal(1,0,0,0);
for(int i = 1;i<=n;i++) ans[0] = max(ans[0],sub[i] + c[i]);
dfs(root,0);
decompose(root,0,0);
sort(all(vs));
for(int i = 2;vs.size();i++)
{
ans[i] = ans[i-1] + vs.back();
vs.pop_back();
}
ans[1] = ans[0];
int t;
cin>>t;
while(t--)
{
int i;
cin>>i;
cout<<TOTAL - ans[i]<<'\n';
}
return 0;
}
