// 私は猫です

#include<bits/stdc++.h>
#define ull unsigned long long
#define ll long long
#define pb push_back
#define mkp make_pair
#define fi first
#define se second
#define inf 1000000000
#define infll 1000000000000000000ll
#define pii pair<int,int>
#define rep(i,a,b,c) for(int i=(a);i<=(b);i+=(c))
#define per(i,a,b,c) for(int i=(a);i>=(b);i-=(c))
#define F(i,a,b) for(int i=(a);i<=(b);i++)
#define dF(i,a,b) for(int i=(a);i>=(b);i--)
#define cmh(sjy) while(sjy--)
#define lowbit(x) (x&(-x))
#define HH printf("\n")
#define eb emplace_back
#define poly vector<int>
using namespace std;
ll read(){
	ll x=0,f=1;char c=getchar();
	while(c<'0'||c>'9'){if(c=='-') f=-1;c=getchar();}
	while(c>='0'&&c<='9') x=(x<<3)+(x<<1)+(c^48),c=getchar();
	return x*f;
}
inline void chkmin(int &x,int y){ x=min(x,y); }
inline void chkmax(int &x,int y){ x=max(x,y); }
const int mod=998244353,maxn=300005;
int fir[maxn],euler_seq[maxn],dep[maxn],Timer,n;
int rev[maxn],dfn[maxn],tim,fa[maxn],top[maxn],siz[maxn],son[maxn];
vector<int>g[maxn];
void init_dfs(int u,int f=0){
	dep[u]=dep[f]+1,euler_seq[fir[u]=++Timer]=u,fa[u]=f,siz[u]=1,son[u]=0;
	for(auto it=g[u].begin();it!=g[u].end();++it){
		const int v=*it;
		if(v==f)continue;
		init_dfs(v,u),euler_seq[++Timer]=u,siz[u]+=siz[v];
		if(siz[v]>siz[son[u]])son[u]=v;
	}
}
void dfs2(int u,int t=1){
	rev[dfn[u]=++tim]=u,top[u]=t;
	if(!son[u])return;
	dfs2(son[u],t);
	for(auto it=g[u].begin();it!=g[u].end();++it){
		const int v=*it;
		if(v^fa[u]&&v^son[u]) dfs2(v,v);
	}
}
namespace getlca{
	int mn[maxn][21];
	void lca_init(){
		F(i,1,n<<1) mn[i][0]=euler_seq[i];
		F(j,1,20) F(i,1,(n<<1)-(1<<j)+1){
			int L=mn[i][j-1],R=mn[i+(1<<(j-1))][j-1];
			mn[i][j]=(dep[L]<dep[R])?L:R;
		}
	}
	int lca(int u,int v){
		int l=fir[u],r=fir[v];
		if(l>r) swap(l,r);
		int t=__lg(r-l+1),L=mn[l][t],R=mn[r-(1<<t)+1][t];
		return dep[L]<dep[R]?L:R;
	}	
}
using getlca::lca;
int dist(int u,int v){ return dep[u]+dep[v]-(dep[lca(u,v)]<<1)+1; }
int rt[maxn];
namespace seg1{
	int ls[maxn<<5],rs[maxn<<5],t[maxn<<5],tot=0;
	void update(int &o,int pre,int l,int r,int pos){
		o=++tot;
		ls[o]=ls[pre],rs[o]=rs[pre],t[o]=t[pre]+1;
		if(l==r) return;
		int mid=(l+r)>>1;
		(pos<=mid)?update(ls[o],ls[pre],l,mid,pos):update(rs[o],rs[pre],mid+1,r,pos);
	}
	int query(int u,int v,int u1,int v1,int l,int r,int k){
		if(l==r)return l;
	    int mid=(l+r)>>1;
	    int cnt=t[rs[u]]+t[rs[v]]-t[rs[u1]]-t[rs[v1]];
	    if(cnt>=k)return query(rs[u],rs[v],rs[u1],rs[v1],mid+1,r,k);
	    return query(ls[u],ls[v],ls[u1],ls[v1],l,mid,k-cnt);
	}
	void clear(){
		F(i,1,tot)ls[i]=rs[i]=t[i]=0;
		tot=0;
	}
}
void dfs1(int u,int f=0){
	seg1::update(rt[u],rt[f],1,n,u);
	for(auto it=g[u].begin();it!=g[u].end();++it){
		const int v=*it;
		if(v^f)dfs1(v,u);
	}
}
vector<pair<int,int>>vec[maxn];
namespace seg{
	#define lc (o<<1)
	#define rc (o<<1|1)
	int t[maxn<<2];
	void init(){ memset(t,0,sizeof t); }
	void update(int o,int l,int r,int ql,int qr){
		if(ql<=l&&qr>=r)return ++t[o],void();
		int mid=(l+r)>>1;
		if(ql<=mid)update(lc,l,mid,ql,qr);
		if(qr>mid) update(rc,mid+1,r,ql,qr);
	}
	int query(int o,int l,int r,int pos){
		if(l==r)return t[o];
		int mid=(l+r)>>1;
		return ((pos<=mid)?query(lc,l,mid,pos):query(rc,mid+1,r,pos))+t[o];
	}
}
void update(int u,int v){
	for(;top[u]^top[v];u=fa[top[u]]){
		if(dep[top[u]]<dep[top[v]])swap(u,v);
		seg::update(1,1,n,dfn[top[u]],dfn[u]);
	}
	if(dfn[u]>dfn[v])swap(u,v);
	seg::update(1,1,n,dfn[u],dfn[v]);
}
void solve(){
	n=read(),tim=Timer=0,seg1::clear();
	F(i,1,n) g[i].clear(),rt[i]=0,vec[i].clear();
	F(i,1,n-1){
		int u=read(),v=read();
		g[u].push_back(v),g[v].push_back(u);
	}init_dfs(1),getlca::lca_init(),dfs1(1),dfs2(1);
	int cmh=read();
	F(i,1,cmh){
		int u=read(),v=read(),k=read();
		chkmin(k,dist(u,v));
		const int t=lca(u,v);
		int x=seg1::query(rt[u],rt[v],rt[t],rt[fa[t]],1,n,k);
//		printf("path=(%d,%d) k=%d kthmax=%d\n",u,v,k,x);
		vec[x].push_back(mkp(u,v));
	}
	seg::init();
	F(i,1,n){
		for(auto it=vec[i].begin();it!=vec[i].end();++it){
			const int u=it->first,v=it->second;
			update(u,v);
		}
		printf("%d ",seg::query(1,1,n,dfn[i]));
	}
	puts("");
}
signed main(){
	int sjy=read();
	cmh(sjy) solve();
}