#define DEBUG 0
#include <bits/stdc++.h>
using namespace std;
#if DEBUG
// basic debugging macros
int __i__,__j__;
#define printLine(l) for(__i__=0;__i__<l;__i__++){cout<<"-";}cout<<endl
#define printLine2(l,c) for(__i__=0;__i__<l;__i__++){cout<<c;}cout<<endl
#define printVar(n) cout<<#n<<": "<<n<<endl
#define printArr(a,l) cout<<#a<<": ";for(__i__=0;__i__<l;__i__++){cout<<a[__i__]<<" ";}cout<<endl
#define print2dArr(a,r,c) cout<<#a<<":\n";for(__i__=0;__i__<r;__i__++){for(__j__=0;__j__<c;__j__++){cout<<a[__i__][__j__]<<" ";}cout<<endl;}
#define print2dArr2(a,r,c,l) cout<<#a<<":\n";for(__i__=0;__i__<r;__i__++){for(__j__=0;__j__<c;__j__++){cout<<setw(l)<<setfill(' ')<<a[__i__][__j__]<<" ";}cout<<endl;}
// advanced debugging class
// debug 1,2,'A',"test";
class _Debug {
public:
template<typename T>
_Debug& operator,(T val) {
cout << val << endl;
return *this;
}
};
#define debug _Debug(),
#else
#define printLine(l)
#define printLine2(l,c)
#define printVar(n)
#define printArr(a,l)
#define print2dArr(a,r,c)
#define print2dArr2(a,r,c,l)
#define debug
#endif
// define
#define MAX_VAL 999999999
#define MAX_VAL_2 999999999999999999LL
#define EPS 1e-6
#define mp make_pair
#define pb push_back
// typedef
typedef unsigned int UI;
typedef long long int LLI;
typedef unsigned long long int ULLI;
typedef unsigned short int US;
typedef pair<int,int> pii;
typedef pair<LLI,LLI> plli;
typedef vector<int> vi;
typedef vector<LLI> vlli;
typedef vector<pii> vpii;
typedef vector<plli> vplli;
// ---------- END OF TEMPLATE ----------
struct edge { int v,c,d; };
vector<edge> adjList[200000];
LLI ans[200001],ss[200000];
int doDFS(int u,int p) {
int i;
for (i = 0; i < adjList[u].size(); i++) {
int v = adjList[u][i].v;
if (v != p) doDFS(v,u),ss[u] += ss[v]+adjList[u][i].d;
}
return 0;
}
int doDFS2(int u,int p,LLI d) {
int i;
ss[u] += d,ans[1] = max(ans[1],ss[u]);
for (i = 0; i < adjList[u].size(); i++) {
int v = adjList[u][i].v;
if (v != p) doDFS2(v,u,ss[u]-ss[v]-adjList[u][i].d+adjList[u][i].c);
}
return 0;
}
int deg[200000],done[200000];
priority_queue<pair<LLI,int> > H;
int main() {
int i;
int N,Q;
int A,B,C,D;
LLI sum = 0;
scanf("%d",&N);
for (i = 0; i < N-1; i++) {
scanf("%d %d %d %d",&A,&B,&C,&D);
A--,B--;
adjList[A].pb((edge){B,C,D});
adjList[B].pb((edge){A,D,C});
sum += C+D;
}
doDFS(0,-1);
doDFS2(0,-1,0);
ans[1] = sum-ans[1];
for (i = 0; i < N; i++) {
if (adjList[i].size() == 1) H.push(mp(-adjList[i][0].d,i));
deg[i] = adjList[i].size();
}
while (H.size() > 2) {
int u = H.top().second;
LLI d = -H.top().first;
H.pop();
done[u] = 1;
for (i = 0; i < adjList[u].size(); i++) {
if (!done[adjList[u][i].v]) break;
}
int v = adjList[u][i].v;
deg[v]--;
if (deg[v] == 1) {
for (i = 0; i < adjList[v].size(); i++) {
if (!done[adjList[v][i].v]) {
H.push(mp(-(d+adjList[v][i].d),v));
break;
}
}
}
else ans[H.size()] = ans[H.size()+1]+d;
}
int E;
scanf("%d",&Q);
for (i = 0; i < Q; i++) {
scanf("%d",&E);
printf("%lld\n",ans[E]);
}
return 0;
}
