//这回只花了114514min就打完了。
//真好。记得多手造几组。
#include <bits/stdc++.h>
//#define int long long
#define pai 3.141592653589793238462643383279502884197169399375105820
#define MOD 1000000007
#define eps 0.00000001
inline int min(int a,int b) {return a<b?a:b;}
inline int max(int a,int b) {return a>b?a:b;}
#define ULL unsigned long long
#define LL long long
#define INF 0x3f3f3f3f
#define INF_LL 0x3f3f3f3f3f3f3f3f
static char buf[1000000],*paa=buf,*pd=buf;
static char buf2[1000000],*pp=buf2;
#define getchar() paa==pd&&(pd=(paa=buf)+fread(buf,1,1000000,stdin),paa==pd)?EOF:*paa++
inline void pc(char ch){
	if(pp-buf2==1000000) fwrite(buf2,1,1000000,stdout),pp=buf2;
	*pp++=ch;
}
inline void pcc(){
	fwrite(buf2,1,pp-buf2,stdout);
	pp=buf2;
}
inline int read(void) {
	int w=1;
	register int x(0);register char c(getchar());
	while(c<'0'||c>'9') {if(c=='-') w=-1;c=getchar();}
	while(c>='0'&&c<='9') x=(x<<1)+(x<<3)+(c^48),c=getchar();
	return w*x;
}
void write(int x) {
	if(x<0) pc('-'),x=-x;
	static int sta[20];
	int top=0;
	do {
		sta[top++]=x%10,x/=10;
	} while(x);
	while(top) pc(sta[--top]+48);
}
void we(int x) {
	write(x);
	pc('\n');
}
inline bool cmp_xi(int a,int b) {return a<b;}
inline bool cmp_da(int a,int b) {return a>b;}
int N,Q,hd[5009],pa[5009],dep[5009],to[10009],nxt[10009],k,vi[5009];
std::set<int> t[5009];
void dfs(int n,int f) {
	pa[n]=f;
	dep[n]=dep[f]+1;
	for(int i=hd[n];i;i=nxt[i]) if(to[i]!=f) dfs(to[i],n); 
} 
inline void l(int u,int v) {nxt[++k]=hd[u],to[k]=v,hd[u]=k;}
signed main(void) {
    //freopen("m.in","r",stdin);
    //freopen("m.out","w",stdout);
	N=read();
assert(N<=5000);
	for(int i=1;i<N;i++) {
		int u=read(),v=read();
		l(u,v),l(v,u);
	}
	dfs(1,0);
	Q=read();
	while(Q--) {
		int u=read(),v=read(),d=read();
		memset(vi,-1,sizeof(vi));
		vi[u]=vi[v]=d;
		while(u!=v) {
			if(dep[u]<dep[v]) std::swap(u,v);
			u=pa[u];
			vi[u]=d;
		}
		for(int i=1;i<=N;i++) if(vi[i]!=-1) t[vi[i]].insert(i);
		for(int i=N;i>=1;i--) {
			for(auto it=t[i].begin();it!=t[i].end();it++) {
				int x=(*it);
				for(int j=hd[x];j;j=nxt[j]) {
					if(vi[to[j]]<i-1) {
						if(vi[to[j]]>=0) t[vi[to[j]]].erase(to[j]);
						vi[to[j]]=i-1;
						t[vi[to[j]]].insert(to[j]);
					}
				}
			}
		}
		int as=0;
		for(int i=0;i<=N;i++) t[i].clear();
		for(int i=1;i<=N;i++) if(vi[i]!=-1) as++;
		printf("%d\n",as);		
	}
    return 0;
}