#include <bits/stdc++.h>
using namespace std;
#define ll long long
const int MAXN = 2e5;
int n, q;
vector<int> v[MAXN+5];
int fa[MAXN+5], dep[MAXN+5], siz[MAXN+5], heavy[MAXN+5], top[MAXN+5];
void d(int i) {
	siz[i] = 1;
	for (int p=0;p<v[i].size();p++) {
		if (v[i][p]!=fa[i]) {
			fa[v[i][p]] = i;
			dep[v[i][p]] = dep[i]+1;
			d(v[i][p]);
			siz[i]+=siz[v[i][p]];
			if (siz[v[i][p]]>siz[heavy[i]]) heavy[i] = v[i][p];
		}
	}
	return ;
}
int st[MAXN+5], en[MAXN+5], dfn[MAXN+5], tot;
void df(int i, int last) {
	st[i] = ++tot;
	dfn[tot] = i;
	top[i] = last;
	if (heavy[i]) df(heavy[i], last);
	for (int p=0;p<v[i].size();p++) {
		if (v[i][p]!=fa[i]&&v[i][p]!=heavy[i]) df(v[i][p], v[i][p]);
	}
	en[i] = tot;
	return ;
}
struct e{
	int id, k, x;
};
vector<e> d1[MAXN+5], d2[MAXN+5], d3[MAXN+5];
int ans[MAXN+5];
#define lowbit(x) ((x)&(-(x)))
int T[MAXN+5];
void insert(int i, int x) {
	i++;
	while (i<=n) {
		T[i]+=x;
		i+=lowbit(i);
	}
	return ;
}
int found(int i) {
	i++;
	int u = 0;
	while (i>0) {
		u+=T[i];
		i-=lowbit(i);
	}
	return u;
}
void dfs(int i, bool keep) {
	for (int p=0;p<v[i].size();p++) {
		if (v[i][p]!=fa[i]&&v[i][p]!=heavy[i]) dfs(v[i][p], 0);
	}
	if (heavy[i]) dfs(heavy[i], 1);
	for (int p=0;p<v[i].size();p++) {
		if (v[i][p]!=fa[i]&&v[i][p]!=heavy[i]) {
			for (int k=st[v[i][p]];k<=en[v[i][p]];k++) {
				insert(dep[dfn[k]], 1);
			}
		}
	}
	for (int p=0;p<d1[i].size();p++) {
		ans[d1[i][p].id]+=d1[i][p].x*found(dep[i]+d1[i][p].k);
	}
	insert(dep[i], 1);
	if (!keep) {
		for (int p=st[i];p<=en[i];p++) {
			insert(dep[dfn[p]], -1);
		}
	}
	return ;
}
void rec(int i) {
	for (int p=0;p<v[i].size();p++) {
		if (v[i][p]!=fa[i]&&v[i][p]!=heavy[i]) {
			for (int k=st[v[i][p]];k<=en[v[i][p]];k++) {
				insert(dep[dfn[k]]-dep[i], 1);
			}
		}
	}
	for (int p=0;p<d2[i].size();p++) {
		ans[d2[i][p].id]+=d2[i][p].x*found(d2[i][p].k);
	}
	for (int p=0;p<v[i].size();p++) {
		if (v[i][p]!=fa[i]) rec(v[i][p]);
	}
	for (int p=0;p<v[i].size();p++) {
		if (v[i][p]!=fa[i]&&v[i][p]!=heavy[i]) {
			for (int k=st[v[i][p]];k<=en[v[i][p]];k++) {
				insert(dep[dfn[k]]-dep[i], -1);
			}
		}
	}
	return ;
}
bool vis[MAXN+5];
int SIZ, rt, maxp[MAXN+5];
void getrt(int i, int last) {
	siz[i] = 1, maxp[i] = 0;
	st[i] = ++tot;
	dfn[tot] = i;
	for (int p=0;p<v[i].size();p++) {
		if (!vis[v[i][p]]&&v[i][p]!=last) {
			dep[v[i][p]] = dep[i]+1;
			getrt(v[i][p], i);
			siz[i]+=siz[v[i][p]];
			maxp[i] = max(maxp[i], siz[v[i][p]]);
		}
	}
	en[i] = tot;
	maxp[i] = max(maxp[i], SIZ-siz[i]);
	if (maxp[i]<maxp[rt]) rt = i;
	return ;
}
void divide(int i) {
	vis[i] = 1;
	insert(0, 1);
	for (int p=0;p<v[i].size();p++) {
		if (!vis[v[i][p]]) {
			for (int k=st[v[i][p]];k<=en[v[i][p]];k++) {
				insert(dep[dfn[k]]-dep[i], 1);
			}
		}
	}
	for (int p=0;p<v[i].size();p++) {
		if (!vis[v[i][p]]) {
			for (int k=st[v[i][p]];k<=en[v[i][p]];k++) {
				insert(dep[dfn[k]]-dep[i], -1);
			}
			for (int k=st[v[i][p]];k<=en[v[i][p]];k++) {
				int s = dfn[k];
				for (int j=0;j<d3[s].size();j++) {
					ans[d3[s][j].id]+=d3[s][j].x*found(d3[s][j].k-(dep[s]-dep[i]));
				}
			}
			for (int k=st[v[i][p]];k<=en[v[i][p]];k++) {
				insert(dep[dfn[k]]-dep[i], 1);
			}
		}
	}
	insert(0, -1);
	for (int p=0;p<d3[i].size();p++) {
		ans[d3[i][p].id]+=d3[i][p].x*found(d3[i][p].k);
	}
	for (int p=0;p<v[i].size();p++) {
		if (!vis[v[i][p]]) {
			for (int k=st[v[i][p]];k<=en[v[i][p]];k++) {
				insert(dep[dfn[k]]-dep[i], -1);
			}
		}
	}
	for (int p=0;p<v[i].size();p++) {
		if (!vis[v[i][p]]) {
			SIZ = siz[v[i][p]];
			rt = 0;
			tot = 0;
			dep[v[i][p]] = 0;
			getrt(v[i][p], 0);
			dep[rt] = 0;
			tot = 0;
			getrt(rt, 0);
			divide(rt);
		}
	}
	return ;
}
int main() {
	//freopen("ex_tiv1.in", "r", stdin);
	//freopen("tiv.out", "w", stdout);
	scanf("%d", &n);
	for (int p=1;p<n;p++) {
		int x, y;
		scanf("%d %d", &x, &y);
		v[x].push_back(y);
		v[y].push_back(x);
	}
	d(1);
	df(1, 1);
	scanf("%d", &q);
	for (int p=1;p<=q;p++) {
		int x, y, k;
		scanf("%d %d %d", &x, &y, &k);
		if (x==y) {
			d3[x].push_back({p, k, 1});
			ans[p]++;
			continue;
		}
		while (top[x]!=top[y]) {
			if (dep[top[x]]>dep[top[y]]) swap(x, y);
			d1[y].push_back({p, k, 1});
			d1[top[y]].push_back({p, k-1, -1});
			ans[p]--;
			d2[fa[y]].push_back({p, k, 1});
			d2[fa[top[y]]].push_back({p, k, -1});
			ans[p]+=dep[y]-dep[top[y]]+1;
			y = fa[top[y]];
		}
		if (dep[x]>dep[y]) swap(x, y);
		ans[p]+=dep[y]-dep[x]+1;
		if (x!=y) {
			d1[y].push_back({p, k, 1});
			d2[fa[y]].push_back({p, k, 1});
			d2[x].push_back({p, k, -1});
			d1[heavy[x]].push_back({p, k-1, -1});
			ans[p]--;
		}
		d3[x].push_back({p, k, 1});
	}
	dfs(1, 0);
	rec(1);
	SIZ = maxp[0] = n;
	dep[1] = 0;
	tot = 0;
	getrt(1, 0);
	dep[rt] = 0;
	tot = 0;
	getrt(rt, 0);
	divide(rt);
	for (int p=1;p<=q;p++) {
		printf("%d\n", ans[p]);
	}
	return 0;
}