#include<bits/stdc++.h>
using namespace std;
template<typename T>inline void read(T &x){
	x=0;
	char ch=getchar();
	bool flag=0;
	while(ch>'9'||ch<'0') flag=flag||ch=='-',ch=getchar();
	while(ch>='0'&&ch<='9') x=x*10+ch-'0',ch=getchar();
	x=flag?-x:x;
}
template<typename T,typename ...Args>inline void read(T &x,Args &...args){
	read(x),read(args...);
}
template<typename T>inline void prt(T x){
	if(x>9) prt(x/10);
	putchar(x%10+'0');
}
template<typename T>inline void put(T x){
	if(x<0) putchar('-'),x=-x;
	prt(x);
}
template<typename T>inline void put(char ch,T x){
	put(x),putchar(ch);
}
template<typename T,typename ...Args>inline void put(char ch,T x,Args ...args){
	put(ch,x),put(ch,args...);
}
#define N 200005
int n,q,ans[N]; 
int head[N],cnt;
struct edge{
	int v,nxt;
}e[N<<1];
inline void add(int u,int v){
	e[++cnt]=(edge){v,head[u]},head[u]=cnt;
}
namespace Devide{
	vector<pair<int,int> >ques[N];
	bool vis[N];
	inline int get_siz(int x,int fa){
		if(vis[x]) return 0;
		int siz=1;
		for(int i=head[x];i;i=e[i].nxt)
			if(e[i].v!=fa) siz+=get_siz(e[i].v,x);
		return siz;
	}
	inline int get_wc(int x,int fa,int sum,int &wc){
		if(vis[x]) return 0;
		int siz=1,ms=0;
		for(int i=head[x];i;i=e[i].nxt){
			int v=e[i].v,t;
			if(v==fa) continue;
			t=get_wc(v,x,sum,wc),ms=max(ms,t),siz+=t;
		}
		ms=max(ms,sum-siz);
		if(ms<=sum/2) wc=x;
		return siz;
	}
	int t[N],maxlen,p[N],nowlen;
	inline void get_dist(int x,int fa,int dep,vector<pair<int,int> >& ins){
		if(vis[x]) return;
		nowlen=max(nowlen,dep),p[dep]++,ins.emplace_back(x,dep);
		for(int i=head[x];i;i=e[i].nxt){
			int v=e[i].v;
			if(v==fa) continue;
			get_dist(v,x,dep+1,ins);
		}
	}
	inline void devide(int x){
		if(vis[x]) return;
		get_wc(x,0,get_siz(x,0),x),vis[x]=1;
		maxlen=0,t[0]++;
		vector<pair<int,int> > all;
		all.emplace_back(x,0);
		for(int i=head[x];i;i=e[i].nxt){
			int v=e[i].v;
			if(vis[v]) continue;
			vector<pair<int,int> > ins;
			nowlen=0,get_dist(v,x,1,ins);
			for(int j=1;j<=nowlen;j++) p[j]+=p[j-1];
			for(auto val:ins){
				int u=val.first,d=val.second;
				for(auto tmp:ques[u])
					if(tmp.first>=d) ans[tmp.second]-=p[tmp.first-d];
				all.emplace_back(val);
			}
			for(int j=nowlen;j;j--) p[j]-=p[j-1];
			maxlen=max(maxlen,nowlen);
			for(int j=0;j<=nowlen;j++) t[j]+=p[j],p[j]=0;
		}
		for(int i=1;i<=maxlen;i++) t[i]+=t[i-1];
		for(auto val:all){
			int u=val.first,d=val.second;
			for(auto tmp:ques[u]) 
				if(tmp.first>=d) ans[tmp.second]+=t[tmp.first-d];
		}
		for(int i=0;i<=maxlen;i++) t[i]=0;
		for(int i=head[x];i;i=e[i].nxt) devide(e[i].v);
	}
	inline void solve(){
		memset(vis,0,sizeof(vis));
		memset(t,0,sizeof(t));
		devide(1);
	}
}
namespace Chain{
	int fa[N],dfn[N],dep[N],top[N],idx,son[N],siz[N];
	struct BIT{
		int c[N];
		BIT(){memset(c,0,sizeof(c));}
		#define lowbit(X) (X&-X)
		inline void update(int x,int v){
			for(;x<=n+1;x+=lowbit(x)) c[x]+=v;
		}
		inline int query(int x){
			int res=0;
			for(;x;x^=lowbit(x)) res+=c[x];
			return res;
		}
		inline int query(int l,int r){
			return query(r)-query(l-1);
		}
		#undef lowbit
	}B;
	inline void dfs1(int x,int fat){
		fa[x]=fat,dep[x]=dep[fat]+1,siz[x]=1;
		for(int i=head[x];i;i=e[i].nxt){
			int v=e[i].v;
			if(v==fat) continue;
			dfs1(v,x),siz[x]+=siz[v];
			if(siz[son[x]]<siz[v]) son[x]=v; 
		}
	}
	inline void dfs2(int x,int tf){
		top[x]=tf,dfn[x]=++idx;
		if(son[x]) dfs2(son[x],tf);
		for(int i=head[x];i;i=e[i].nxt)
			if(e[i].v!=son[x]&&e[i].v!=fa[x]) dfs2(e[i].v,e[i].v);
	}
	inline int lca(int x,int y){
		while(top[x]!=top[y]){
			if(dep[top[x]]<dep[top[y]]) swap(x,y);
			x=fa[top[x]];
		}
		return x;
	}
	struct Ques{
		int l,r,id,val;
		Ques(){}
		Ques(int _l,int _r,int _id,int _val):l(_l),r(_r),id(_id),val(_val){}
	};
	vector<Ques> g1[N];
	vector<Ques> g2[N];
	inline void insert1(int x,int d,int id,int val){
		if(x<1||x>n||d<0) return;
		g1[dfn[x]-1].emplace_back(dep[x],min(dep[x]+d,n),id,-val);
		g1[dfn[x]+siz[x]-1].emplace_back(dep[x],min(dep[x]+d,n),id,val);
	}
	inline void insert2(int x,int d,int id,int val){
		if(x<1||x>n||d<0) return;
		g2[dfn[top[x]]-1].emplace_back(1,d+1,id,-val);
		g2[dfn[x]].emplace_back(1,d+1,id,val);
	}
	inline void insert(int x){
		int d=dep[x];
		while(x){
			g2[dfn[x]].emplace_back(d-dep[x]+1,0,0,1);
			x=fa[top[x]];
		}
	}
	inline void update(int x,int d,int id,int val){
		insert1(son[x],d-1,id,val);
		while(x){
			int p=top[x];
			insert1(p,d-1,id,-val);
//			insert1(son[fa[p]],d-1,id,val);
			insert2(x,d,id,val);
			x=fa[p];
		}
	}
	inline void prework(){
		memset(fa,0,sizeof(fa));
		memset(dfn,0,sizeof(dfn));
		memset(dep,0,sizeof(dep));
		memset(top,0,sizeof(top));
		memset(son,0,sizeof(son));
		memset(siz,0,sizeof(siz));
		idx=0;
		dfs1(1,0),dfs2(1,1);
	}
	inline void solve(){
		B=BIT();
		for(int i=1;i<=n;i++) g1[dfn[i]].emplace_back(dep[i],0,0,1);
		for(int i=1;i<=n;i++){
			for(auto tmp:g1[i]){
				if(tmp.id) ans[tmp.id]+=tmp.val*B.query(tmp.l,tmp.r);
				else B.update(tmp.l,tmp.val);
			}
		}
		B=BIT();
		for(int i=1;i<=n;i++) insert(i);
		for(int i=1;i<=n;i++){
			for(auto tmp:g2[i]){
				if(tmp.id) ans[tmp.id]+=tmp.val*B.query(tmp.l,tmp.r);
				else B.update(tmp.l,tmp.val);
			}
		}
	}
}
int main(){
	read(n);
	for(int i=1,u,v;i<n;i++) read(u,v),add(u,v),add(v,u);
	read(q),Chain::prework();
	for(int i=1,x,y,d;i<=q;i++){
		read(x,y,d);
		int z=Chain::lca(x,y);
		Devide::ques[z].emplace_back(d,i);
		Chain::update(x,d,i,1);
		Chain::update(y,d,i,1);
		Chain::update(z,d,i,-2);
	}
	Devide::solve();
	Chain::solve();
	for(int i=1;i<=q;i++) put('\n',ans[i]);
	return 0;
}