#include<bits/stdc++.h>
#define Gc() getchar() 
#define Me(x,y) memset(x,y,sizeof(x))
#define Mc(x,y) memcpy(x,y,sizeof(x))
#define d(x,y) ((m)*(x-1)+(y))
#define R(n) (rnd()%(n)+1)
#define Pc(x) putchar(x)
#define LB lower_bound
#define UB upper_bound
#define PB push_back
#define fi first
#define se second
using ll=long long;using db=double;using lb=long db;using ui=unsigned;using ull=unsigned long long;using LL=__int128;
using namespace std;const int N=2e5+5,M=N*4+5,K=20,mod=1e4+7,Mod=mod-1;const db eps=1e-9;const int INF=1e9+7;mt19937 rnd(263082);
int n,q,x,y,z,fa[N],Sn[N],Si[N],d[N],Tp[N],ans[N];vector<int> S[N];
void dfs1(int x,int La){fa[x]=La;Si[x]=1;d[x]=d[La]+1;for(int i:S[x]) if(i^La) dfs1(i,x),Si[x]+=Si[i],Si[Sn[x]]<Si[i]&&(Sn[x]=i);}
void dfs2(int x,int La){Tp[x]=La;if(Sn[x]) dfs2(Sn[x],Sn[x]);for(int i:S[x]) if(i^fa[x]&&i^Sn[x]) dfs2(i,i);}
int LCA(int x,int y){while(Tp[x]^Tp[y]) d[Tp[x]]<d[Tp[y]]&&(swap(x,y),0),x=fa[Tp[x]];return d[x]<d[y]?x:y;}
struct BIT{
	int f[N];void Add(int x,int y){while(x<=n) f[x]+=y,x+=x&-x;}int Qry(int x){x=min(x,n);int Ans=0;while(x) Ans+=f[x],x-=x&-x;return Ans;}
}f1,f2,g;
vector<pair<int,int> > QQ[N];
namespace Part1{
	int vis[N],Si[N],Ct,Rt,f[N];
	void GI(int x,int La){Si[x]=1;Ct++;for(int i:S[x]) if(i^La&&!vis[i]) GI(i,x),Si[x]+=Si[i];}
	void DP(int x,int La){f[x]=Ct-Si[x];for(int i:S[x]) if(i^La&&!vis[i]) DP(i,x),f[x]=max(f[x],Si[i]);if(f[x]<f[Rt]) Rt=x;}
	void Ins(int x,int La,int d,int w){g.Add(d+1,w);for(int i:S[x]) if(i^La&&!vis[i]) Ins(i,x,d+1,w);}
	void Qry(int x,int La,int d){
		for(auto i:QQ[x]) if(d<=i.fi) ans[i.se]+=g.Qry(i.fi-d+1);
		for(int i:S[x]) if(i^La&&!vis[i]) Qry(i,x,d+1);
	}
	void Solve(int x){
		Ct=0;GI(x,0);f[Rt=0]=INF;DP(x,0);vis[x=Rt]=1;
		Ins(x,0,0,1);for(auto i:QQ[x]) ans[i.se]+=g.Qry(i.fi+1);
		for(int i:S[x]) if(!vis[i]) Ins(i,x,1,-1),Qry(i,x,1),Ins(i,x,1,1);
		Ins(x,0,0,-1);for(int i:S[x]) if(!vis[i]) Solve(i);
	}
}
vector<pair<int,int> > Q1[N],Q2[N];
void AQ(int x,int y,int Id){Q1[x].PB({y,Id});if(y) Q2[x].PB({y-1,-Id});}
void Push(int x,int y,int z,int Id){while(Tp[x]^Tp[y]) Sn[x]&&(AQ(Sn[x],z,-Id),0),AQ(Tp[x],z,Id),x=fa[Tp[x]];Sn[x]&&(AQ(Sn[x],z,-Id),0);Sn[y]&&(AQ(Sn[y],z,Id),0);}
void Ins(int x,int La,int D,int w){f2.Add(d[x],w);f1.Add(D+1,w);for(int i:S[x]) if(i^La) Ins(i,x,D+1,w);}
void Cl(int x,int La){f2.Add(d[x],-1);f1.Add(1,-1);for(int i:S[x]) if(i^La&&i^Sn[x]) Ins(i,x,1,-1);if(Sn[x]) Cl(Sn[x],x);}
void dfs(int x,int La){//cerr<<"x4 "<<x<<' '<<f1.Qry(2)<<'\n';
	for(int i:S[x]) if(i^La&&i^Sn[x]) dfs(i,x),Cl(i,x);
	if(Sn[x]) dfs(Sn[x],x);for(int i:S[x]) if(i^La&&i^Sn[x]) Ins(i,x,1,1);f2.Add(d[x],1);f1.Add(1,1);
	for(auto i:Q1[x]) ans[abs(i.se)]+=(i.se/abs(i.se))*f1.Qry(i.fi+1);
	for(auto i:Q2[x]) ans[abs(i.se)]+=(i.se/abs(i.se))*f2.Qry(d[x]+i.fi);
}
int main(){
	int i,j;scanf("%d",&n);for(i=1;i<n;i++) scanf("%d%d",&x,&y),S[x].PB(y),S[y].PB(x);
	dfs1(1,0);dfs2(1,1);scanf("%d",&q);for(i=1;i<=q;i++){
		scanf("%d%d%d",&x,&y,&z);int Ls=LCA(x,y);QQ[Ls].PB({z,i});
		Push(x,Ls,z,i);Push(y,Ls,z,i);
	}
	Part1::Solve(1);cerr<<ans[1]<<'\n';
	dfs(1,0);
	for(i=1;i<=q;i++) printf("%d\n",ans[i]);
}