#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define db double
#define gc getchar
#define pb push_back
#define abs_(x) max(x,-(x))
#define tomin(x,y) x=min(x,y)
#define tomax(x,y) x=max(x,y)
#define For(i,a,b) for(int i=(a);i<=(b);i++)
#define dFor(i,a,b) for(int i=(a);i>=(b);i--)
#define all(x) x.begin(),x.end()
const int N=2e5+5;
int read()
{
	int x=0; int y=1; char c=gc();
	for(;!isdigit(c);c=getchar()) if(c=='-') y=0;
	for(;isdigit(c);c=getchar()) x=(x<<3)+(x<<1)+(c^48);
	return y?x:-x;
}
int n,Q;
vector<int> e[N];

int ans[N];

int fa[N],d[N],sz[N],son[N],dfn[N],idfn[N],ed[N],dct,top[N];
int bz[20][N],lg[N];
void dfs0(int u)
{
	d[u]=d[fa[u]]+1;
	sz[u]=1;
	son[u]=0;
	for(int v:e[u]) if(v^fa[u])
	{
		fa[v]=u;
		dfs0(v);
		sz[u]+=sz[v];
		if(sz[v]>sz[son[u]]) son[u]=v;
	}
}
void dfs1(int u,int tp)
{
	top[u]=tp;
	dfn[u]=++dct;
	idfn[dfn[u]]=u;
	bz[0][dct]=dfn[fa[u]];
	
	if(son[u]) dfs1(son[u],tp);
	for(int v:e[u]) if((v^fa[u])&&(v^son[u]))
	{
		dfs1(v,v);
	}
	ed[u]=dct;
}
int get_mn(int l,int r)
{
	int t=lg[r-l+1];
	return min(bz[t][l],bz[t][r-(1<<t)+1]);
}
int lca(int u,int v)
{
	if(u==v) return u;
	u=dfn[u],v=dfn[v];
	if(u>v) swap(u,v);
	return idfn[get_mn(u+1,v)];
}
int dis(int u,int v)
{
	return d[u]+d[v]-2*d[lca(u,v)]; 
}


int Fa[N],Sz[N],Rt,n2;
bool vs[N];
vector<int> d1[N],d2[N];
int tsz[N],mx[N];
void dfs2(vector<int> &x,int u,int fa,int s)
{
//	cout<<u<<" "; 
//	cout<<"          "<<s<<" "<<u<<endl;
//	cout<<u<<endl;
	x[dis(u,s)]++;
	for(int v:e[u]) if((v^fa)&&!vs[v]) dfs2(x,v,u,s);
}
int get_sz(int u,int fa)
{
//	cout<<u<<endl;
	int s=1;
	for(int v:e[u]) if((v^fa)&&!vs[v]) s+=get_sz(v,u);
	return s; 
}
void get_rt(int u,int fa)
{
//	cout<<u<<endl;
	tsz[u]=1; mx[u]=0;
	for(int v:e[u]) if((v^fa)&&!vs[v])
	{
		get_rt(v,u);
		tsz[u]+=tsz[v];
		tomax(mx[u],tsz[v]);
	}
	tomax(mx[u],n2-tsz[u]);
	if(mx[u]*2<=n2) Rt=u;
}
void Divide(int u)
{
//	cout<<u<<endl;
	vs[u]=1;
	d1[u].resize(Sz[u]+3,0);
	d2[u].resize(Sz[u]+3,0);
	dfs2(d1[u],u,0,u);
//	puts("");
	if(u^1) dfs2(d2[u],u,0,Fa[u]);
//	puts("");
	for(int i=1;i<d1[u].size();i++) d1[u][i]+=d1[u][i-1];
	for(int i=1;i<d2[u].size();i++) d2[u][i]+=d2[u][i-1];
//	for(int i=0;i<d1[u].size();i++) cout<<d2[u][i]<<" ";
//	puts("");
//	puts("");
	for(int v:e[u]) if(!vs[v])
	{
		n2=get_sz(v,u);
		get_rt(v,u);
		Fa[Rt]=u;
		Sz[Rt]=n2;
		Divide(Rt);
	}
}
int query1(int u,int d)
{
	int s=0;
	for(int v=u;v;v=Fa[v])
	{
		int t=dis(v,u);
		if(t<=d) 
		{
			s+=d1[v][d-t];
//			cout<<u<<" "<<v<<" "<<d<<" "<<t<<"   "<<d1[v][d-t]<<","<<d2[v][d-t]<<endl;
			if(v!=1&&dis(v,Fa[v])<=d) s-=d2[v][d-dis(v,Fa[v])];
		}
	}
	return s;
}

void pre1()
{
	For(i,2,n) lg[i]=lg[i>>1]+1;
	dfs0(1);
	dfs1(1,1);
	For(i,1,lg[n])
	{
		For(j,1,n-(1<<i)+1) bz[i][j]=min(bz[i-1][j],bz[i-1][j+(1<<i-1)]);
	}
	Sz[1]=n;
	Divide(1);
//	For(i,1,n)
//	{
//		For(j,1,n) cout<<dis(i,j)<<" ";
//		puts("");
//	}
}




struct _N
{
	int id,d,x;
};
vector<_N> g1[N],g2[N];
void solve(int id,int u,int d,int x)
{
	g1[u].pb((_N){id,d,x});
	if(d)
	{
		g2[son[u]].pb((_N){id,d-1,x});
		for(int v=top[u];v^1;v=top[fa[v]])
		{
			g2[v].pb((_N){id,d-1,-x});
			g2[son[fa[v]]].pb((_N){id,d-1,x});
		}
	}
}
namespace B
{
	int c[N];
	void cls() { memset(c,0,sizeof(c)); }
	#define lb(x) x&-x
	void add(int x,int y)
	{
		x++;
		for(int i=x;i<=n;i+=lb(i)) c[i]+=y;
	}
	void cls(int x)
	{
		x++;
		for(int i=x;i<=n;i+=lb(i)) c[i]=0;
	}
	int get(int x)
	{
		x++;
		int s=0;
		for(int i=x;i;i-=lb(i)) s+=c[i];
		return s;
	} 
	int get(int l,int r) { return get(r)-get(l-1); }
	#undef lb
}
void dfs4(int u,int d,int x)
{
	B::add(d,x);
	for(int v:e[u]) if(v^fa[u]) dfs4(v,d+1,x);
}
void dfs3(int u)
{
	B::add(0,1);
	for(int v:e[u]) if((v^fa[u])&&(v^son[u])) dfs4(v,1,1);
	for(auto t:g1[u])
	{
		int s=B::get(t.d)*t.x;
//		cout<<"           "<<t.id<<" "<<u<<" "<<t.d<<" "<<s<<endl;
		ans[t.id]+=s;
	}
	for(int v:e[u]) 
	{
		if((v^fa[u])) dfs3(v);
	}
	B::add(0,-1);
	for(int v:e[u]) if((v^fa[u])&&(v^son[u])) dfs4(v,1,-1);
}
void dfs6(int u,int x)
{
	B::add(d[u],x);
	for(int v:e[u]) if(v^fa[u]) dfs6(v,x);
}
void dfs5(int u,bool cs)
{
	for(int v:e[u]) if((v^fa[u])&&(v^son[u])) dfs5(v,1);
	if(son[u]) dfs5(son[u],0);
	B::add(d[u],1);
	for(int v:e[u]) if((v^fa[u])&&(v^son[u])) dfs6(v,1);
	for(auto t:g2[u])
	{
		int s=B::get(d[u],d[u]+t.d)*t.x;
//		cout<<"   "<<t.id<<" "<<u<<" "<<t.d<<" "<<s<<endl;
		ans[t.id]+=s;
	}
	if(cs)
	{
		For(k,dfn[u],ed[u]) B::cls(d[idfn[k]]);
	}
}
void work1()
{
	dfs3(1);
	dfs5(1,1);
}
void Cls()
{
	For(u,1,n) e[u].clear();
	dct=0;
	memset(ans,0,Q+2<<2);
	For(u,1,n) d1[u].clear();
	For(u,1,n) d2[u].clear();
	memset(vs,0,n+2);
	
	For(u,1,n) g1[u].clear();
	For(u,1,n) g2[u].clear();
}


void work()
{
	n=read();
	For(i,1,n-1)
	{
		int u=read(),v=read();
		e[u].pb(v);
		e[v].pb(u);
	}
	pre1();
	Q=read();
	For(i,1,Q)
	{
		int u=read(),v=read(),d=read();
		int lc=lca(u,v);
//		cout<<lc<<endl;
		solve(i,u,d,1);
		solve(i,v,d,1);
		solve(i,lc,d,-2);
		ans[i]+=query1(lc,d);
//		cout<<"    "<<query1(u,d)<<" "<<query1(v,d)<<endl;
	}
	work1();
	For(i,1,Q) printf("%d\n",ans[i]);
	
	Cls();
}
signed main()
{
//	freopen("ex_color.in","r",stdin);
//	freopen("color.in","r",stdin);
//	freopen("color.out","w",stdout);
	int T=1;
	while(T--) work();
	return 0;
}


/*

*/