#include <bits/stdc++.h>
#define LL long long
using namespace std;
const int N=1000000;
int fa[N],siz[N],val[N],c[N],t[N],s[N],ans[N],top=0;
struct H{
	int p,ofa,osiz,oval;
	void recover(){
		fa[p]=ofa;
		siz[p]=osiz;
		val[p]=oval;
	}
}stk[N];
vector<pair<int,int> > e1[N],e2[N];
vector<int> poi[N];
int find(int p){
	if(fa[p]) return find(fa[p]);
	return p;
}
void merge(int a,int b){
	// cerr<<
	a=find(a),b=find(b);
	if(a==b) return;
	if(siz[a]>siz[b]) swap(a,b);
	stk[++top]={a,fa[a],siz[a],val[a]};
	stk[++top]={b,fa[b],siz[b],val[b]};
	fa[a]=b;
	siz[b]+=siz[a];
	val[b]=max(val[b],val[a]);
}
void upd(int a,int b){
	a=find(a);
	if(val[a]>ans[b]) return;
	stk[++top]={a,fa[a],siz[a],val[a]};
	val[a]=ans[b];
}
void ins(int p,int l,int r,const int &ql,const int &qr,const int &typ,const pair<int,int> &e){
	if(ql>qr) return;
	if(ql<=l&&qr>=r){
		if(typ) e1[p].push_back(e);
		else e2[p].push_back(e);
		return;
	}
	int mid=(l+r)>>1;
	if(ql<=mid) ins(p<<1,l,mid,ql,qr,typ,e);
	if(qr>mid) ins(p<<1|1,mid+1,r,ql,qr,typ,e);
}
void solve(int p,int l,int r){
	int otop=top;
	for(auto it:e2[p]) merge(it.first,it.second);
	for(auto it:e1[p]) upd(it.first,it.second);
	if(l==r){
		for(auto it:poi[l]) ans[it]=val[find(it)];
	}
	else{
		int mid=(l+r)>>1;
		solve(p<<1|1,mid+1,r);
		solve(p<<1,l,mid);
	}
	while(top!=otop) stk[top--].recover();
}
int disc(int n){
	static int b[N];
	for(int i=1;i<=n;i++) b[i]=c[i];
	for(int i=1;i<=n;i++) b[i+n]=t[i];
	sort(b+1,b+2*n+1);
	int m=unique(b+1,b+2*n+1)-b-1;
	for(int i=1;i<=n;i++) c[i]=lower_bound(b+1,b+m+1,c[i])-b;
	for(int i=1;i<=n;i++) t[i]=lower_bound(b+1,b+m+1,t[i])-b;
	return m;
}
signed main(){
	ios::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
	int n,m;
	cin>>n>>m;
	for(int i=1;i<=n;i++) cin>>c[i]>>t[i]>>s[i];
	int v=disc(n);
	for(int i=1;i<=n;i++){
		poi[c[i]].push_back(i);
		siz[i]=1;
		val[i]=s[i];
	}
	for(int i=1;i<=m;i++){
		int u,v;
		cin>>u>>v;
		if(c[u]>c[v]) swap(u,v);
		ins(1,1,v,c[v],min(t[u],t[v]),0,{u,v});
		ins(1,1,v,c[u],min(c[v]-1,t[v]),1,{u,v});
	}
	solve(1,1,v);
	for(int i=1;i<=n;i++) cout<<ans[i]<<' ';
	return 0;
}