#include<bits/stdc++.h>
using namespace std;
int n;
#define pb push_back
const int N=2e5+10;
vector<int>g[N];
namespace Dia{
    bool vis[N];
    int di[25][N],F[N],dk[N];
    int ae[N*25];
    int al[N],ar[N],bl[N],br[N],cn;
    int sz[N],rt,Mx,S;
    void df(int x,int f){
        sz[x]=1;int mm=-1;
        for(int v:g[x])
            if(v!=f&&!vis[v])df(v,x),mm=max(mm,sz[v]),sz[x]+=sz[v];
        mm=max(mm,S-sz[x]);if(mm<Mx)Mx=mm,rt=x;
    }
    int T1[N],T2[N],md1,md2;
    int O,oe;
    void dfs2(int x,int d,int f){
        oe++;
        di[O][x]=d;
        while(md1<d)md1++,T1[md1]=0;
        while(md2<d)md2++,T2[md2]=0;
        T1[d]++,T2[d]++;
        for(int v:g[x])
            if(v!=f&&!vis[v])dfs2(v,d+1,x),sz[x]+=sz[v];
    }
    int fz[N];
    void sol(int x){
        vis[x]=1,O=dk[x];
        T1[0]=(x<=n),md1=0;
        for(int v:g[x])if(!vis[v]){
            T2[0]=0,md2=0;
            oe=0,dfs2(v,1,0);
            for(int i=1;i<=md2;i++)T2[i]+=T2[i-1];
            S=oe,Mx=S+1,df(v,0);
            F[rt]=x,dk[rt]=dk[x]+1,fz[v]=rt;
            bl[rt]=cn+1,br[rt]=cn+md2+1;
            for(int i=0;i<=md2;i++)ae[++cn]=T2[i];
        }
        for(int i=1;i<=md1;i++)T1[i]+=T1[i-1];
        al[x]=cn+1,ar[x]=cn+md1+1;
        for(int i=0;i<=md1;i++)ae[++cn]=T1[i];
        for(int v:g[x])if(!vis[v])sol(fz[v]);
    }
    int oi[N],fp[N];
    int Ask(int x,int d){
        if(d<0)return 0;
        int u=x,su=0,nx=0;
        while(u){
            int oi=di[dk[u]][x];
            if(oi<=d){
                su+=ae[min(ar[u],al[u]+d-oi)];
                if(nx)su-=ae[min(br[nx],bl[nx]+d-oi)];
            }
            nx=u,u=F[u];
        }
        return su;
    }
    void build(){
        oe=cn=0;
        for(int i=1;i<=n;i++)T1[i]=T2[i]=oi[i]=fp[i]=dk[i]=ae[i]=al[i]=ar[i]=bl[i]=br[i]=F[i]=dk[i]=0,vis[i]=0;
        S=n,Mx=n+1,df(1,0),sol(rt);
    }
}
int sz[201000],son[201000],dfn[201000],top[200100],db[200100],bel[200100],fa[201000],d[201000];
void dfs(int x){
    sz[x]=1;int mm=-1;
    for(int v:g[x])if(v!=fa[x]){
        fa[v]=x,d[v]=d[x]+1,dfs(v);
        if(mm<sz[v])mm=sz[v],son[x]=v;
sz[x]+=sz[v];
    }
}
void dfs2(int x,int ff){
    bel[dfn[x]=++dfn[0]]=x,top[x]=ff;
    if(!son[x]){db[x]=x;return;}
    dfs2(son[x],ff),db[x]=db[son[x]];
    for(int v:g[x])if(v!=fa[x]&&v!=son[x])dfs2(v,v);
}
int lca(int u,int v){
    if(top[u]!=top[v]){
        if(d[top[u]]<d[top[v]])swap(u,v);
        u=fa[top[u]];
    }
    if(d[u]>d[v])swap(u,v);return u;
}
struct BIT{
    int tr[201000];
    bool vis[201000];
    int sta[200100],top;
    inline void ad(int x,int z){
        for(x++;x<=n+1;x+=(x&-x)){
            if(!vis[x])vis[x]=1,sta[++top]=x;
            tr[x]+=z;
        }
    }
    inline int ask(int x){
        if(x<0)return 0;
        x=min(x,n);
        int s=0;
        for(x++;x;x-=(x&-x))s+=tr[x];
        return s;
    }
    inline void cl(){
        while(top)vis[sta[top]]=0,tr[sta[top]]=0,top--;
    }
}T;
int ans[200100];
vector<array<int,3> >G[200100];
void sg(int u,int d,int id,int z){
    while(u)
        G[u].pb({d,id,z}),u=fa[top[u]];
}
void sol(){
    scanf("%d",&n);
    for(int i=1;i<=n;i++)g[i].clear(),sz[i]=son[i]=dfn[i]=top[i]=db[i]=bel[i]=fa[i]=d[i]=0,G[i].clear();
    for(int i=1,u,v;i<n;i++)scanf("%d%d",&u,&v),g[u].pb(v),g[v].pb(u);
    Dia::build();
    dfn[0]=0,dfs(1),dfs2(1,1);
    int q;
    scanf("%d",&q);
    for(int i=1,u,v,d;i<=q;i++){
        scanf("%d%d%d",&u,&v,&d);
        int lc=lca(u,v);
        ans[i]=Dia::Ask(lc,d);
        sg(u,d,i,1),sg(v,d,i,1),sg(lc,d,i,-2);
    }
    for(int t=1;t<=n;t++)if(top[t]==t){
        for(int j=dfn[t];j<=dfn[db[t]];j++){
            int u=bel[j];
            T.ad(0,1),T.ad(d[u]-d[t]+1,-1);
            if(son[u]){
                for(int k=dfn[son[u]]+sz[son[u]];k<dfn[u]+sz[u];k++){
                    int z=d[bel[k]]-d[u];
                    T.ad(z,1),T.ad(z+1+(d[u]-d[t]),-1);
                }
            }
            for(auto it:G[u])ans[it[1]]+=T.ask(it[0])*it[2];
        }
        T.cl();
        for(int j=dfn[db[t]];j>dfn[t];j--){
            int u=bel[j];
            T.ad(d[u]-d[t],1);
            if(son[u]){for(int k=dfn[son[u]]+sz[son[u]];k<dfn[u]+sz[u];k++)T.ad(d[bel[k]]-d[t],1);}
            for(auto it:G[fa[u]])
            ans[it[1]]+=(T.ask(it[0]+(d[u]-d[t]-1))-T.ask(it[0]-1))*it[2];
        }
        T.cl();
    }
    for(int i=1;i<=q;i++)printf("%d\n",ans[i]);
}
int main(){
    int T=1;while(T--)sol();
    return 0;
}