#include<bits/stdc++.h>
using namespace std;
typedef tuple<int, int, int> ti3;
const int N = 200003;
int n, m, c[N], t[N], s[N], u[N], v[N], fa[N], siz[N], ans[N], mx[N], tp;
int getf(int x){while(x != fa[x]) x = fa[x]; return x;}
struct Node {
	int x, y, val;
	Node(int _1 = 0, int _2 = 0, int _3 = 0): x(_1), y(_2), val(_3){}
} stk[N];
void merg(int x, int y){
	x = getf(x); y = getf(y);
	if(x == y) return;
	if(siz[x] < siz[y]) swap(x, y);
	fa[y] = x; siz[x] += siz[y];
	stk[++tp] = Node(x, y, mx[x]);
	ans[x] = mx[x] = max(ans[x], mx[y]);
}
void work(const vector<ti3> &vc, int L, int R){
	if(vc.empty()) return;
	vector<ti3> vl, vr;
	int md = L + R >> 1, lst = tp;
	for(auto [l, r, id] : vc){
		if(l <= L && R <= r){
			if(id > 0) merg(u[id], v[id]);
			else {
				stk[++tp] = Node(u[-id], 0, mx[u[-id]]);
				mx[u[-id]] = max(mx[u[-id]], ans[v[-id]]);
				ans[u[-id]] = max(ans[u[-id]], mx[u[-id]]);
			}
		} else {
			if(l <= md) vl.emplace_back(l, r, id);
			if(md < r) vr.emplace_back(l, r, id);
		}
	}
	work(vr, md + 1, R); work(vl, L, md);
	while(tp > lst){
		int x = stk[tp].x, y = stk[tp].y;
		if(y){
			ans[y] = max(ans[x], ans[y]);
			siz[x] -= siz[y];
		}
		fa[y] = y; mx[x] = stk[tp].val; -- tp;
	}
}
int main(){
	ios::sync_with_stdio(false);
	cin >> n >> m;
	for(int i = 1;i <= n;++ i){cin >> c[i] >> t[i] >> mx[i]; fa[i] = i; siz[i] = 1; ans[i] = mx[i];}
	vector<ti3> ed;
	for(int i = 1;i <= m;++ i){
		cin >> u[i] >> v[i];
		if(c[u[i]] > c[v[i]]) swap(u[i], v[i]);
		int l = c[v[i]], r = min(t[u[i]], t[v[i]]);
		if(l <= r) ed.emplace_back(l, r, i);
		l = c[u[i]]; r = min(t[u[i]], c[v[i]] - 1);
		if(l <= r) ed.emplace_back(l, r, -i);
	}
	work(ed, 1, 1000000000);
	for(int i = 1;i <= n;++ i) printf("%d%c", ans[i], " \n"[i == n]);
}