#include <bits/stdc++.h>

 using namespace std;

 const int maxn =  + ;

 struct Edge

 {

     int from,to,dist;

 };

 vector<Edge> G[maxn];

 int pa[maxn];

 bool vis[maxn];

 int dis[maxn][maxn];

 void dfs(int u,int fa)

 {

     int d = G[u].size();

     for(int i=; i<d; i++)

     {

         int v = G[u][i].to;

         if(v!=fa)

             dfs(v,pa[v]=u);

     }

 }

 void _dfs(int k,int cur,int cost) {

     vis[cur] = ;

     int d = G[cur].size();

     for(int i=;i<d;i++) {

         if(!vis[G[cur][i].to]) {

             dis[k][G[cur][i].to] = max(cost,max(dis[k][G[cur][i].to],G[cur][i].dist));

             int v = G[cur][i].to;

             _dfs(k,v,dis[k][v]);

         }

     }

 }

 int main()

 {

     int n;

     int kase = ;

     while(scanf("%d",&n)!=EOF)

     {

         printf("Test #%d\n",++kase);

         for(int i=;i<n;i++)

             G[i].clear();

         int sum = ;

         for(int i=; i<n-; i++)

         {

             int u,v,d;

             scanf("%d%d%d",&u,&v,&d);

             u--;

             v--;

             sum+=d;

             G[u].push_back((Edge)

             {

                 u,v,d

             });

             G[v].push_back((Edge)

             {

                 v,u,d

             });

             dis[u][v] = d;

             dis[v][u] = d;

         }

         pa[] = -;

         dfs(,-);

         for(int i=;i<n;i++) {

             memset(vis,,sizeof(vis));

             vis[i] = ;

             _dfs(i,i,);

         }

         int q;

         scanf("%d",&q);

         while(q--)

         {

             memset(vis,,sizeof(vis));

             int u,v,d;

             scanf("%d%d%d",&u,&v,&d);

             u--;

             v--;

             int maxx = ;

             maxx = dis[u][v];

             if(maxx>d)

                 printf("%d\n",sum-maxx+d);

             else printf("%d\n",sum);

         }

     }

     return ;

 }