#include<iostream>

 #include<cstdio>

 #include<cstring>

 #define M 100010

 #define ls ch[node][0]

 #define rs ch[node][1]

 using namespace std;

 int n,m,num,cnt,root,S;

 int head[M],son[M],sz[M],top[M],deep[M],fa[M],f[M],size[M],maxn[M],dis[M],rt[M];

 int val[M<<],ch[M<<][];bool vis[M];

 struct point{int to,next,dis;}e[M<<];

 void add(int from,int to,int dis) {

     e[++num].next=head[from];

     e[num].to=to;

     e[num].dis=dis;

     head[from]=num;

 }

 void dfs1(int x) {

     sz[x]=;deep[x]=deep[fa[x]]+;

     for(int i=head[x];i;i=e[i].next) {

         int to=e[i].to;

         if(to==fa[x]) continue;

         fa[to]=x,dis[to]=dis[x]+e[i].dis;

         dfs1(to),sz[x]+=sz[to];

         if(sz[son[x]]<sz[to]) son[x]=to;

     }

 }

 void dfs2(int x,int tp) {

     top[x]=tp;

     if(son[x]) dfs2(son[x],tp);

     for(int i=head[x];i;i=e[i].next)

         if(e[i].to!=fa[x]&&e[i].to!=son[x])

             dfs2(e[i].to,e[i].to);

 }

 int lca(int x,int y) {

     while(top[x]!=top[y]) {

         if(deep[top[x]]<deep[top[y]]) swap(x,y);

         x=fa[top[x]];

     }

     return deep[x]<deep[y]?x:y;

 }

 int getdis(int x,int y) {

     return dis[x]+dis[y]-*dis[lca(x,y)];

 }

 void getroot(int x,int fa) {

     size[x]=;maxn[x]=;

     for(int i=head[x];i;i=e[i].next) {

         int to=e[i].to;

         if(to==fa||vis[to]) continue;

         getroot(to,x),size[x]+=size[to];

         maxn[x]=max(maxn[x],size[to]);

     }

     maxn[x]=max(maxn[x],S-size[x]);

     if(maxn[x]<maxn[root]) root=x;

 }

 void solve(int x,int ff) {

     vis[x]=true,f[x]=ff;

     for(int i=head[x];i;i=e[i].next) {

         int to=e[i].to;

         if(vis[to]) continue;

         S=size[to],root=,getroot(to,);

         solve(root,x);

     }

 }

 void update(int node) {

     if(ls) val[node]=min(val[node],val[ls]);

     if(rs) val[node]=min(val[node],val[rs]);

 }

 void insert(int &node,int l,int r,int x,int v) {

     if(!node) node=++cnt,val[node]=1e9;

     if(l==r) {

         val[node]=v;return;

     }

     int mid=(l+r)/;

     if(x<=mid) insert(ls,l,mid,x,v);

     else insert(rs,mid+,r,x,v);

     update(node);

 }

 int query(int node,int l,int r,int l1,int r1) {

     if(!node) return 1e9;

     if(l1<=l&&r1>=r) return val[node];

     int mid=(l+r)/,ans=1e9;

     if(l1<=mid) ans=min(ans,query(ls,l,mid,l1,r1));

     if(r1>mid) ans=min(ans,query(rs,mid+,r,l1,r1));

     return ans;

 }

 void pushin(int x) {

     for(int i=x;i;i=f[i])

         insert(rt[i],,n,x,getdis(x,i));

 }

 int ask(int x,int l,int r) {

     int ans=1e9;

     for(int i=x;i;i=f[i])

         ans=min(ans,getdis(x,i)+query(rt[i],,n,l,r));

     return ans;

 }

 int main() {

     scanf("%d",&n);

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

         int x,y,z;scanf("%d%d%d",&x,&y,&z);

         add(x,y,z),add(y,x,z);

     }

     dfs1(),dfs2(,);

     S=maxn[]=n,getroot(,),solve(root,);

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

     scanf("%d",&m);

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

         int l,r,x;scanf("%d%d%d",&l,&r,&x);

         printf("%d\n",ask(x,l,r));

     }

     return ;

 }