#include <bits/stdc++.h>
using namespace std;
#define dbgv(v) cout<<#v<<" = "; f(i,0,v.size()) cout<<v[i]<<" "; cout<<endl
#define dbga(a,x,y) cout<<#a<<" = "; f(i,x,y) cout<<a[i]<<" "; cout<<endl
#define erorp(x) cout<<#x<<"={"<<(x.F)<<" , "<<x.S<<"}"<<endl
#define eror(x) cout<<#x<<'='<<(x)<<endl
#define f_(i,a,b) for(int i=a;i>=b;i--)
#define f(i,a,b) for(int i=a;i<b;i++)
#define nb(x) __builtin_popcount(x)
#define all(v) v.begin(),v.end()
#define bit(n,k) (((n)>>(k))&1)
#define Add(x,y) x=(x+y)%mod
#define maxm(a,b) a=max(a,b)
#define minm(a,b) a=min(a,b)
#define lst(x) x[x.size()-1]
#define sz(x) int(x.size())
#define mp make_pair
#define ll long long
#define pb push_back
#define S second
#define F first
#define int ll
const int N=1e6+99,inf=1e15;
int n,t,rt,X,Y,q,sum,cnt,to[N],ts[N],w[N],res[N],ans[N],pes[N],h[N],mark[N],par[N],st[N],ft[N],wp[N],lazy[N];
pair<int,int> dp[N],seg[N];
vector<int> g[N];
void dfs1(int u,int p){
for(auto id : g[u]){
int v=to[id];
if(v==p) continue ;
res[rt]+=w[id];
dfs1(v,u);
}
}
void dfs2(int u,int p){
vector<pair<int,int> > vec(3);
for(auto id : g[u]){
int v=to[id];
if(v==p) continue ;
res[v]=res[u]-w[id]+w[id^1];
dfs2(v,u);
dp[v].F+=w[id];
vec[0]=dp[v];
sort(all(vec));
}
if(vec[2].S==0){
dp[u]={0,u};
}
else{
dp[u]=vec[2];
}
pes[u]=inf;
if(vec[1].S!=0 && res[u]-vec[1].F-vec[2].F<ans[2]){
ans[2]=res[u]-vec[1].F-vec[2].F;
X=vec[1].S;
Y=vec[2].S;
}
minm(ans[1],res[u]);
}
void dfs3(int u,int p){
ts[cnt]=u;
st[u]=cnt++;
par[u]=p;
for(auto id : g[u]){
int v=to[id];
if(v==p) continue ;
h[v]=h[u]+w[id];
wp[v]=w[id];
sum+=w[id];
dfs3(v,u);
}
ft[u]=cnt;
}
void shift(int id){
seg[id<<1].F+=lazy[id];
seg[id<<1|1].F+=lazy[id];
lazy[id<<1]+=lazy[id];
lazy[id<<1|1]+=lazy[id];
lazy[id]=0;
}
void build(int id=1,int l=0,int r=n){
if(l+1==r){
seg[id]={h[ts[l]],ts[l]};
return ;
}
int mid=(l+r)>>1;
build(id<<1,l,mid);
build(id<<1|1,mid,r);
seg[id]=max(seg[id<<1],seg[id<<1|1]);
}
void add(int L,int R,int val,int id=1,int l=0,int r=n){
if(r<=L || R<=l) return ;
if(L<=l && r<=R){
seg[id].F+=val;
lazy[id]+=val;
return ;
}
int mid=(l+r)>>1;
shift(id);
add(L,R,val,id<<1,l,mid);
add(L,R,val,id<<1|1,mid,r);
seg[id]=max(seg[id<<1],seg[id<<1|1]);
}
void find(){
fill(ans,ans+N,inf);
rt=1;
while(g[rt].size()==1) rt++;
dfs1(rt,0);
dfs2(rt,0);
rt=X;
dfs3(rt,0);
mark[rt]=1;
}
void do_it(){
build();
f(i,2,n+1){
int u=seg[1].S;
//eror(u);
//sum-=seg[1].F;
while(!mark[u]){
mark[u]=1;
//eror(wp[u]);
sum-=wp[u];
add(st[u],ft[u],-wp[u]);
u=par[u];
}
//eror(sum);
ans[i]=sum;
}
}
main(){
ios::sync_with_stdio(false);cin.tie(nullptr);cout.tie(nullptr);
cin>>n;
f(i,1,n){
int u,v;
cin>>u>>v>>w[2*i]>>w[2*i+1];
to[2*i]=v;
to[2*i+1]=u;
g[u].pb(2*i);
g[v].pb(2*i+1);
}
if(n==2){
ans[1]=min(w[2],w[3]);
cin>>q;
while(q--){
int x;
cin>>x;
cout<<ans[x]<<'\n';
}
exit(0);
}
find();
do_it();
cin>>q;
while(q--){
int x;
cin>>x;
cout<<ans[x]<<'\n';
}
}
