#include <bits/stdc++.h>
#define mp make_pair
#define pb push_back
#define X first
#define Y second
#define y0 y12
#define y1 y22
#define INF 987654321
#define PI 3.141592653589793238462643383279502884
#define fup(i,a,b,c) for(int (i)=(a);(i)<=(b);(i)+=(c))
#define fdn(i,a,b,c) for(int (i)=(a);(i)>=(b);(i)-=(c))
#define MEM0(a) memset((a),0,sizeof(a));
#define MEM_1(a) memset((a),-1,sizeof(a));
#define ALL(a) a.begin(),a.end()
#define SYNC ios_base::sync_with_stdio(false);cin.tie(0)
using namespace std;
typedef long long ll;
typedef long double ld;
typedef double db;
typedef unsigned int uint;
typedef unsigned long long ull;
typedef pair<int, int> Pi;
typedef pair<ll, ll> Pll;
typedef pair<ld, ld> Pd;
typedef vector<int> Vi;
typedef vector<ll> Vll;
typedef vector<ld> Vd;
typedef vector<Pi> VPi;
typedef vector<Pll> VPll;
typedef vector<Pd> VPd;
typedef tuple<int, int, int> iii;
typedef tuple<int, int, int, int> iiii;
typedef tuple<ll, ll, ll> LLL;
typedef tuple<ll, ll, ll, ll> LLLL;
typedef vector<iii> Viii;
typedef vector<LLL> VLLL;
typedef complex<double> base;
const int MOD = 1000000007;
ll POW(ll a, ll b, ll MMM = MOD) { ll ret = 1; for (; b; b >>= 1, a = (a*a) % MMM)if (b & 1)ret = (ret*a) % MMM; return ret; }
ll gcd(ll a, ll b) { return b ? gcd(b, a%b) : a; }
ll lcm(ll a, ll b) { if (a == 0 || b == 0)return a + b; return a*(b / gcd(a, b)); }
int dx[] = { 0,1,0,-1,1,1,-1,-1 }, dy[] = { 1,0,-1,0,1,-1,1,-1 };
int ddx[] = { -1,-2,1,-2,2,-1,2,1 }, ddy[] = { -2,-1,-2,1,-1,2,1,2 };
struct A{
int y;
ll c,d;
};
vector<A> v[200001];
VLLL vv[200001];
int pt[200001],sz[200001];
ll sum,ans[200001];
ll Q1[200001],q1;
LLL Q2[200001];
ll dfs1(int N,int p=-1)
{
ll res=0;
for(auto &P:v[N])
{
if(P.y==p)continue;
res+=P.d+dfs1(P.y,N);
}
return res;
}
void dfs2(int N,ll now,int p=-1)
{
q1=max(q1,now);
Q1[N]=now;
for(auto &P:v[N])
{
if(P.y==p)continue;
dfs2(P.y,now+P.c-P.d,N);
}
}
Pll dfs3(int N,int p=-1)
{
VPll V;
for(auto &P:v[N])
{
if(P.y==p)continue;
Pll pp=dfs3(P.y,N);
V.pb(mp(P.c+pp.X,pp.Y));
}
if(V.empty())return mp(0,N);
sort(V.rbegin(),V.rend());
if(V.size()>1)Q2[N]=LLL(Q1[N]+V[0].X+V[1].X,V[0].Y,V[1].Y);
return V[0];
}
ll T1,T2;
priority_queue<LLLL> Q;
LLL dfs4(int N,int p=-1)
{
for(auto &P:v[N])
{
if(P.y==p)continue;
LLL L=dfs4(P.y,N);
vv[N].pb(LLL(P.y,P.c+get<1>(L),get<2>(L)));
}
sort(ALL(vv[N]),[&](LLL p1,LLL p2){
return get<1>(p1)>get<1>(p2);
});
sz[N]=vv[N].size();
fup(i,0,sz[N]-1,1)Q.push(LLLL(get<1>(vv[N][i]),N,-i,get<2>(vv[N][i])));
if(vv[N].empty())return LLL(0,0,N);
return vv[N][0];
}
int main() {
int n,R;
scanf("%d",&n);
if(n==2)
{
int a,b,c,d,q;
scanf("%d%d%d%d%d",&a,&b,&c,&d,&q);
while(q--)
{
int x;
scanf("%d",&x);
if(x==1)printf("%d\n",min(c,d));
else puts("0");
}
return 0;
}
fup(i,1,n-1,1)
{
int x,y;
ll c,d;
scanf("%d%d%lld%lld",&x,&y,&c,&d);
sum+=c+d;
v[x].pb({y,c,d});
v[y].pb({x,d,c});
}
int leafcnt=0;
fup(i,1,n,1)
{
if(v[i].size()>1)R=i;
else leafcnt++;
}
ll now=dfs1(R);
dfs2(R,now);
int q;
scanf("%d",&q);
ans[1]=q1;
dfs3(R);
R=-1;
LLL mx=LLL(-1,-1,-1);
fup(i,1,n,1)
if(Q2[i]>mx)R=i,mx=Q2[i];
T1=get<1>(mx),T2=get<2>(mx);
dfs4(R);
now=get<0>(mx);
ans[2]=now;
int cc=2;
while(!Q.empty())
{
ll x,N,i,ww;
tie(x,N,i,ww)=Q.top();
i*=-1;
Q.pop();
if(i<pt[N])continue;
if(ww==T1 || ww==T2)
{
while(pt[N]<sz[N])
{
pt[N]++;
N=get<0>(vv[N][pt[N]-1]);
}
continue;
}
cc++,now+=x;
if(cc>=2)ans[cc]=now;
while(pt[N]<sz[N])
{
pt[N]++;
N=get<0>(vv[N][pt[N]-1]);
}
}
while(q--)
{
int x;
scanf("%d",&x);
if(x>=leafcnt)puts("0");
else printf("%lld\n",sum-ans[x]);
}
}
