#include<bits/stdc++.h>
#pragma GCC optimize(3)
using namespace std;
namespace my_std{
	#define ll int
	#define bl bool
	ll my_pow(ll a,ll b,ll mod){
		ll res=1;
		if(!b) return 1;
		while(b){
			if(b&1) res=(res*a)%mod;
			a=(a*a)%mod;
			b>>=1;
		}
		return res;
	}
	ll qpow(ll a,ll b){
		ll res=1;
		if(!b) return 1;
		while(b){
			if(b&1) res*=a;
			a*=a;
			b>>=1;
		}
		return res;
	}
	#define db double
	#define pf printf
	#define pc putchar
	#define fr(i,x,y) for(register ll i=(x);i<=(y);i++)
	#define pfr(i,x,y) for(register ll i=(x);i>=(y);i--)
	#define go(u) for(ll i=head[u];i;i=e[i].nxt)
	#define enter pc('\n')
	#define space pc(' ')
	#define fir first
	#define sec second
	#define MP make_pair
	#define il inline
	#define inf 2e9
	#define random(x) rand()*rand()%(x)
	#define inv(a,mod) my_pow((a),(mod-2),(mod))
	il ll read(){
		ll sum=0,f=1;
		char ch=0;
		while(!isdigit(ch)){
			if(ch=='-') f=-1;
			ch=getchar();
		}
		while(isdigit(ch)){
			sum=sum*10+(ch^48);
			ch=getchar();
		}
		return sum*f;
	}
	il void write(ll x){
		if(x<0){
			x=-x;
			pc('-');
		}
		if(x>9) write(x/10);
		pc(x%10+'0');
	}
	il void writeln(ll x){
		write(x);
		enter;
	}
	il void writesp(ll x){
		write(x);
		space;
	}
}
using namespace my_std;
#define LC lc[x]
#define RC rc[x]
vector<pair<ll,ll> > q1[200020],q2[200020],q3[200020];
ll n,m,head[200020],cnt=0;
ll siz[200020],wson[200020],top[200020],f[200020],dep[200020];
ll rt[200020],tree[5000050],lc[5000050],rc[5000050],tot=0;
ll RT,rsiz,minn,tr[200020],num[200020];
bl ck[200020];
struct edge{
	ll nxt,to;
}e[400040];
struct node{
	ll x,y,lca,d,ans;
}q[200020];
void add(ll u,ll v){
	e[++cnt].nxt=head[u];
	e[cnt].to=v;
	head[u]=cnt;
}
void dfs1(ll fa,ll u){
	f[u]=fa;
	dep[u]=dep[fa]+1;
	siz[u]=1;
	go(u){
		ll v=e[i].to;
		if(v==fa) continue;
		dfs1(u,v);
		if(siz[v]>siz[wson[u]]) wson[u]=v;
		siz[u]+=siz[v];
	}
}
void dfs2(ll u,ll topp){
	top[u]=topp;
	if(wson[u]) dfs2(wson[u],topp);
	go(u){
		ll v=e[i].to;
		if(v==f[u]) continue;
		if(v!=wson[u]) dfs2(v,v);
	}
}
ll get_lca(ll x,ll y){
	while(top[x]!=top[y]){
		if(dep[top[x]]<dep[top[y]]) swap(x,y);
		x=f[top[x]];
	}
	if(dep[x]>dep[y]) swap(x,y);
	return x;
}
void addtag(ll x,ll id,ll v){
	if(!x) return;
	q[id].ans+=v*dep[x];
	if(wson[x]) q1[wson[x]].push_back(MP(id,v));
	while(x){
		q2[x].push_back(MP(id,v));
		if(f[top[x]]){
			q1[top[x]].push_back(MP(id,-v));
			q1[wson[f[top[x]]]].push_back(MP(id,v));
		}
		x=f[top[x]];
	}
}
void pushup(ll x){
	tree[x]=tree[LC]+tree[RC];
}
void mdf(ll &x,ll l,ll r,ll pos){
	if(!x) x=++tot;
	if(l==r){
		tree[x]++;
		return;
	}
	ll mid=(l+r)>>1;
	if(pos<=mid) mdf(LC,l,mid,pos);
	else mdf(RC,mid+1,r,pos);
	pushup(x);
}
ll query(ll x,ll l,ll r,ll ql,ll qr){
	if(!x||ql>qr) return 0;
	if(ql<=l&&r<=qr) return tree[x];
	ll mid=(l+r)>>1,res=0;
	if(ql<=mid) res+=query(LC,l,mid,ql,qr);
	if(mid<qr) res+=query(RC,mid+1,r,ql,qr);
	return res;
}
ll merge(ll x,ll y,ll l,ll r){
	if(!x) return y;
	if(!y) return x;
	if(l==r){
		tree[x]+=tree[y];
		return x;
	}
	ll mid=(l+r)>>1;
	LC=merge(LC,lc[y],l,mid);
	RC=merge(RC,rc[y],mid+1,r);
	pushup(x);
	return x;
}
il ll lowbit(ll x){
	return x&(-x);
}
il void mdf(ll x,ll v){
	while(x<=n){
		tr[x]+=v;
		x+=lowbit(x);
	}
}
il ll query(ll x){
	ll res=0;
	while(x){
		res+=tr[x];
		x-=lowbit(x);
	}
	return res;
}
void solve1(ll fa,ll u){
	mdf(rt[u],1,n,dep[u]);
	go(u){
		ll v=e[i].to;
		if(v==fa) continue;
		solve1(u,v);
		rt[u]=merge(rt[u],rt[v],1,n);
	}
	fr(i,0,(ll)q1[u].size()-1){
		ll id=q1[u][i].fir,v=q1[u][i].sec;
		if(!q[id].d) continue;
		q[id].ans+=v*query(rt[u],1,n,1,min(n,dep[u]+q[id].d-1));
	}
}
void dfs(ll fa,ll u,ll now,ll t){
	mdf(now,t);
	go(u){
		ll v=e[i].to;
		if(v==fa) continue;
		dfs(u,v,now+1,t);
	}
}
void solve2(ll fa,ll u){
	go(u){
		ll v=e[i].to;
		if(v==fa) continue;
		if(v!=wson[u]) dfs(u,v,1,1);
	}
	fr(i,0,(ll)q2[u].size()-1){
		ll id=q2[u][i].fir,v=q2[u][i].sec;
		q[id].ans+=v*query(min(n,q[id].d));
	}
	if(wson[u]) solve2(u,wson[u]);
	go(u){
		ll v=e[i].to;
		if(v==fa) continue;
		if(v!=wson[u]) dfs(u,v,1,-1);
	}
}
void getroot(ll fa,ll u){
	siz[u]=1;
	ll maxx=0;
	go(u){
		ll v=e[i].to;
		if(v==fa||ck[v]) continue;
		getroot(u,v);
		siz[u]+=siz[v];
		maxx=max(maxx,siz[v]);
	}
	maxx=max(maxx,rsiz-siz[u]);
	if(maxx<minn){
		minn=maxx;
		RT=u;
	}
}
void dfs3(ll fa,ll u){
	siz[u]=1;
	dep[u]=dep[fa]+1;
	num[dep[u]]++;
	go(u){
		ll v=e[i].to;
		if(v==fa||ck[v]) continue;
		dfs3(u,v);
	}
}
void dfs4(ll r,ll fa,ll u,ll t){
	fr(i,0,(ll)q3[u].size()-1){
		ll id=q3[u][i].fir;
		if(q[id].d>=dep[u]) q[id].ans+=num[min(siz[r],q[id].d-dep[u])];
	}
	go(u){
		ll v=e[i].to;
		if(v==fa||ck[v]) continue;
		dfs4(r,u,v,t);
	}
}
void solve(ll fa,ll u){
	ck[u]=1;
	dep[u]=0;
	num[0]++;
	go(u){
		ll v=e[i].to;
		if(v==fa||ck[v]) continue;
		dfs3(u,v);
	}
	fr(i,1,siz[u]) num[i]+=num[i-1];
	dfs4(u,fa,u,1);
	fr(i,0,siz[u]) num[i]=0;
	go(u){
		ll v=e[i].to;
		if(v==fa||ck[v]) continue;
		dfs3(u,v);
		fr(j,1,siz[v]) num[j]+=num[j-1];
		dfs4(v,u,v,-1);
		fr(j,0,siz[v]) num[j]=0;
	}
	go(u){
		ll v=e[i].to;
		if(v==fa||ck[v]) continue;
		minn=inf;
		rsiz=siz[v];
		getroot(u,v);
		solve(u,v);
	}
}
int main(){
//	freopen("1.in","r",stdin);
//	freopen("wa.out","w",stdout);
	n=read();
	fr(i,2,n){
		ll u=read(),v=read();
		add(u,v);
		add(v,u);
	}
	dfs1(0,1);
	dfs2(1,1);
	m=read();
	fr(i,1,m){
		q[i].x=read();
		q[i].y=read();
		q[i].d=read();
		q[i].lca=get_lca(q[i].x,q[i].y);
		addtag(q[i].x,i,1);
		addtag(q[i].y,i,1);
		addtag(q[i].lca,i,-2);
		q3[q[i].lca].push_back(MP(i,1));
	}
	solve1(0,1);
	fr(i,1,n) if(top[i]==i) solve2(f[i],i);
	minn=inf;
	rsiz=n;
	getroot(0,1);
	solve(0,RT);
	fr(i,1,m) writeln(q[i].ans);
}