#include<bits/stdc++.h>
#define N 50009
#define M 100009
using namespace std;
const int inf=1e9+7;
int n,m,he[N],cnt,depth[N],Size[N],fa[N],son[N],L[N],R[N],top[N],order[N],timestamps;
struct Edge{
	int ne,to;
}e[M];
pair<int,int>p[N];
inline void add(int u,int v){
	e[++cnt].ne=he[u];
	e[cnt].to=v;
	he[u]=cnt;
}
void dfs1(int u,int from){
	depth[u]=depth[from]+1,fa[u]=from,Size[u]=1;
	for(int i=he[u];i;i=e[i].ne){
		int v=e[i].to;
		if(v==from){
			continue;
		}
		dfs1(v,u);
		Size[u]+=Size[v];
		if(Size[v]>Size[son[u]]){
			son[u]=v;
		}
	}
}
void dfs2(int u,int from,int tp){
	top[u]=tp;
	timestamps++;
	L[u]=timestamps,order[timestamps]=u;
	if(Size[u]==1){
		R[u]=timestamps;
		return ;
	}
	dfs2(son[u],u,tp);
	for(int i=he[u];i;i=e[i].ne){
		int v=e[i].to;
		if(v==from||v==son[u]){
			continue;
		}
		dfs2(v,u,v);
	}
	R[u]=timestamps;
}
struct Node{
	int l,r,minn,tag;
}tr[N*4];
void eval(Node &t,int x){
	t.minn=min(t.minn,x);
	t.tag=min(t.tag,x);
}
void pushdown(int u){
	eval(tr[u<<1],tr[u].tag);
	eval(tr[u<<1|1],tr[u].tag);
	tr[u].tag=inf;
}
void build(int u,int l,int r){
	tr[u].l=l,tr[u].r=r,tr[u].minn=tr[u].tag=inf;
	if(l==r){
		return ;
	}
	int mid=(l+r)>>1;
	build(u<<1,l,mid);
	build(u<<1|1,mid+1,r);
}
void modify(int u,int l,int r,int x){
	if(l>r){
		return ;
	}
	if(tr[u].l>=l&&tr[u].r<=r){
		eval(tr[u],x);
		return ;
	}
	pushdown(u);
	int mid=(tr[u].l+tr[u].r)>>1;
	if(l<=mid){
		modify(u<<1,l,r,x);
	}
	if(r>mid){
		modify(u<<1|1,l,r,x);
	}
}
int query(int u,int d){
	if(tr[u].l==tr[u].r){
		return tr[u].minn;
	}
	pushdown(u);
	int mid=(tr[u].l+tr[u].r)>>1;
	if(d<=mid){
		return query(u<<1,d);
	}
	else return query(u<<1|1,d);
}
void modify_path(int u,int v,int w){
	while(top[u]!=top[v]){
		if(depth[top[u]]<depth[top[v]]){
			swap(u,v);
		}
		modify(1,L[top[u]],L[u],w);
		u=fa[top[u]];
	}
	if(depth[u]>depth[v]){
		swap(u,v);
	}
	modify(1,L[u]+1,L[v],w);
}
signed main(){
	scanf("%d %d",&n,&m);
	for(int i=1;i<n;i++){
		int x,y;
		scanf("%d %d",&x,&y);
		p[i].first=x,p[i].second=y;
		add(x,y);
		add(y,x);
	}
	dfs1(1,0);
	dfs2(1,0,1);
	build(1,1,n);
	for(int i=1;i<=m;i++){
		int u,v,w;
		scanf("%d %d %d",&u,&v,&w);
		modify_path(u,v,w);
	}
	for(int i=1;i<n;i++){
		if(fa[p[i].second]==p[i].first){
			swap(p[i].first,p[i].second);
		}
		if(query(1,L[p[i].first])==inf){
			cout<<-1<<endl;
		}
		cout<<query(1,L[p[i].first])<<endl;
	}
	return 0;
}