#include<bits/stdc++.h>
using namespace std;
const int maxn=2e5+5;
vector<int> G[maxn];
int fa[maxn],siz[maxn],son[maxn],dep[maxn];
inline void dfs1(int x){
	siz[x]=1,son[x]=-1;
	for(auto y:G[x]){
		if(y==fa[x]) continue;
		dep[y]=dep[x]+1;
		fa[y]=x;
		dfs1(y);
		siz[x]+=siz[y];
		if(son[x]==-1 || siz[son[x]]<siz[y]) son[x]=y;
	}
}
int top[maxn],dfn[maxn],rnk[maxn],tot;
inline void dfs2(int x,int tp){
	dfn[x]=++tot;
	rnk[tot]=x;
	top[x]=tp;
	if(son[x]!=-1) dfs2(son[x],tp);
	for(auto y:G[x]){
		if(y!=fa[x] && y!=son[x]) dfs2(y,y);
	}
}
inline int LCA(int x,int y){
	while(top[x]!=top[y]){
		if(dep[top[x]]<dep[top[y]]) y=fa[top[y]];
		else x=fa[top[x]];
	}
	return dep[x]<dep[y]?x:y;
}
inline int dis(int x,int y){
//	if(x==3 && y==2){
//		cout<<LCA(x,y)<<" tad"<<endl;
//	} 
	return dep[x]+dep[y]-(dep[LCA(x,y)]<<1);
}
int n,Q;
int Fa[maxn];
vector<int> v1[maxn],v2[maxn];//子树到自己的贡献，子树到父亲的贡献。 
int vis[maxn];
int dp[maxn],rt;
inline void get_rt(int x,int f,int S){
	siz[x]=1,dp[x]=0;
	for(auto y:G[x]){
		if(f==y || vis[y]) continue;
		get_rt(y,x,S);
		siz[x]+=siz[y],dp[x]=max(dp[x],siz[y]);
	}
	dp[x]=max(dp[x],S-siz[x]);
	if(dp[x]<dp[rt]) rt=x;
}
inline void get_siz(int x,int f){
	siz[x]=1;
	for(auto y:G[x]){
		if(y==f || vis[y]) continue;
		get_siz(y,x);
		siz[x]+=siz[y];
	}
}
inline void get_self(int x,int f,int X){
	v1[X][dis(X,x)]++;
//	if(X==3){
//		cout<<"pyb:"<<dis(X,x)<<endl;
//	} 
	for(auto y:G[x]){
		if(y==f || vis[y]) continue;
		get_self(y,x,X);
	}
}
inline void get_fa(int x,int f,int X){
	v2[X][dis(Fa[X],x)]++;
//	if(X==1){
//		cout<<"pyb2:"<<dis(Fa[X],x)<<" "<<x<<" "<<Fa[X]<<endl;
//	}
	for(auto y:G[x]){
		if(y==f || vis[y]) continue;
		get_fa(y,x,X);
	}
}
inline void solve(int x){
	get_siz(x,x);
	v1[x].resize(siz[x]+2);
	v2[x].resize(siz[x]+2);
	get_self(x,x,x),get_fa(x,x,x);
	for(int i=1;i<(int)v1[x].size();i++)
		v1[x][i]+=v1[x][i-1],v2[x][i]+=v2[x][i-1];
	vis[x]=1;
	for(auto y:G[x]){
		if(vis[y]) continue;
		rt=0;
		get_rt(y,x,siz[y]);
		Fa[rt]=x;
		solve(rt);
	} 
}
inline int get_oneans(int x,int d){
	int ret=0;
	if(d>(int)v1[x].size()-1) ret+=v1[x].back();
	else ret+=v1[x][d];
//	cout<<ret<<endl;
	for(int i=x;Fa[i];i=Fa[i]){//计算 Fa i 到 i 
		int r=dis(Fa[i],x);
		int dd=d-r;
//		cout<<"czc:\n"<<dd<<endl;
		if(dd<0) continue;
		if(dd>(int)v1[Fa[i]].size()-1) ret+=v1[Fa[i]].back();
		else ret+=v1[Fa[i]][dd];
		if(dd>(int)v2[i].size()-1) ret-=v2[i].back();
		else ret-=v2[i][dd];
//		cout<<ret<<endl;
	}
	return ret;
}
int q[maxn],v[maxn],l,r;
inline void solve(int x,int y){
	if(dep[x]<dep[y]) swap(x,y); 
	while(dep[x]>dep[y]){
		q[++r]=x;
		v[x]=1;
		x=fa[x];
	}
	while(x!=y){
		q[++r]=x;
		q[++r]=y;
		v[x]=v[y]=1;
		x=fa[x],y=fa[y];
	}
	q[++r]=x;
	v[x]=1;
}
int main(){
	scanf("%d",&n);
	for(int i=1,x,y;i<n;i++){
		scanf("%d%d",&x,&y);
		G[x].push_back(y),G[y].push_back(x);
	}
	dep[1]=1,dfs1(1);
	dfs2(1,1);
	dp[0]=n+1,rt=0;
	get_rt(1,1,n);
	solve(rt);
//	for(int i=1;i<=n;i++){
//		cout<<Fa[i]<<" "; 
//	} 
//	cout<<endl;
	scanf("%d",&Q);
	while(Q--){
		int x,y,d;
		scanf("%d%d%d",&x,&y,&d);
		if(x==y){
			printf("%d\n",get_oneans(x,d));
			continue;
		}
		for(int i=1;i<=n;i++) v[i]=0;
		l=1,r=0;
		solve(x,y);
		while(l<=r){
			int xz=q[l++];
			for(auto yz:G[xz]){
				if(!v[yz] && v[xz]<=d){
					v[yz]=v[xz]+1;
					q[++r]=yz;
				}
			}
		}
		printf("%d\n",r);
	}
	return 0;
}