#include <bits/stdc++.h>
using namespace std;
const int N = 400010;
int n, m;
int c[N], t[N], s[N];
int p[N], lp;
struct Edge {
	int x, y;
}; Edge edge[N];
int ans[N];
vector<int> q[N];
vector<pair<int, int> > bicon[N * 4], oneway[N * 4];
struct Sta {
	int u, fa, w, sz;
}; Sta sta[N * 2]; int top = 0;
int fa[N], w[N], sz[N];

int find(int x) {
	return x == fa[x] ? x : find(fa[x]);
}
void insert_bi(int u, int l, int r, int L, int R, pair<int, int > w) {
	if(L <= l && r <= R) {
		bicon[u].push_back(w); return ;
	}
	int mid = (l + r) >> 1;
	if(L <= mid) insert_bi(u * 2, l, mid, L, R, w);
	if(R > mid) insert_bi(u * 2 + 1, mid + 1, r, L, R, w);
}
void insert_one(int u, int l, int r, int L, int R, pair<int, int > w) {
	if(L <= l && r <= R) {
		oneway[u].push_back(w); return ;
	}
	int mid = (l + r) >> 1;
	if(L <= mid) insert_one(u * 2, l, mid, L, R, w);
	if(R > mid) insert_one(u * 2 + 1, mid + 1, r, L, R, w);
}
void merge(int x, int y) {
	x = find(x), y = find(y); if(x == y) return ;
	if(sz[x] > sz[y]) swap(x, y);
	++top;
	sta[top].fa = x, sta[top].u = x;
	sta[top].sz = sz[x], sta[top].w = w[x];
	++top;
	sta[top].fa = y, sta[top].u = y;
	sta[top].sz = sz[y], sta[top].w = w[y];
	fa[x] = y, sz[y] += sz[x], w[y] = max(w[y], w[x]);
}
void dfs(int u, int l, int r) {
	int cur = top;
	for(auto v : bicon[u]) merge(v.first, v.second);
	for(auto v : oneway[u]) {
		int x = v.first, y = v.second;
		x = find(x), y = find(y);
		if(x == y) continue;
		++top;
		sta[top].u = x, sta[top].fa = x;
		sta[top].sz = sz[x], sta[top].w = w[x];
		w[x] = max(w[x], w[y]);
	}
	if(l >= r) {
		for(auto v : q[l]) ans[v] = w[find(v)];
		return ;
	}
	else {
		int mid = (l + r) >> 1;
		dfs(u * 2 + 1, mid + 1, r), dfs(u * 2, l, mid);
	}
	for(; top > cur; --top) {
		fa[sta[top].u] = sta[top].fa;
		sz[sta[top].u] = sta[top].sz;
		w[sta[top].u] = sta[top].w;
	}
}
int main() {
	ios::sync_with_stdio(0); cin.tie(nullptr);
	cin >> n >> m;
	for(int i = 1; i <= n; i++) {
		cin >> c[i] >> t[i] >> s[i];
		p[++lp] = c[i], p[++lp] = t[i];
	}
	sort(p + 1, p + lp + 1), lp = unique(p + 1, p + lp + 1) - p - 1;
	for(int i = 1; i <= n; i++) {
		c[i] = lower_bound(p + 1, p + lp + 1, c[i]) - p;
		t[i] = lower_bound(p + 1, p + lp + 1, t[i]) - p;
		q[c[i]].push_back(i);
	}
	for(int i = 1; i <= m; i++) {
		int x, y; cin >> x >> y;
		if(max(c[x], c[y]) <= min(t[x], t[y])) {
			insert_bi(1, 1, lp, max(c[x], c[y]), min(t[x], t[y]), {x, y});
		}
		if(c[x] > c[y]) swap(x, y);
		if(c[x] <= min(t[x], c[y] - 1)) {
			insert_one(1, 1, lp, c[x], min(t[x], c[y] - 1), {x, y});
		}
	}
	for(int i = 1; i <= n; i++) fa[i] = i, w[i] = s[i], sz[i] = 1;
	dfs(1, 1, lp);
	for(int i = 1; i <= n; i++) cout << ans[i] << " \n"[i == n];
	return 0;
}