#include <bits/stdc++.h>
using namespace std;
const int N = 400010;
int n, m;
int c[N], t[N], s[N];
int id[N];
struct Edge {
	int x, y, w;
}; Edge edge[N];
int tot, fa[N];
vector<int> e[N];
int dfn[N], low[N], rev[N], idx = 0, f[N][20], dep[N];
int ans[N];
set<pair<int, int> > st;

int find(int x) {
	return x == fa[x] ? x : fa[x] = find(fa[x]);
}
void dfs(int u, int ff) {
	dep[u] = dep[ff] + 1, f[u][0] = ff;
	for(int i = 1; i <= 19; i++) f[u][i] = f[f[u][i - 1]][i - 1];
	dfn[u] = ++idx, rev[idx] = u;
	if(u <= n) st.insert({dfn[u], u});
	for(auto v : e[u]) dfs(v, u);
	low[u] = idx;
}
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];
		id[i] = i;
	}
	sort(id + 1, id + n + 1, [](int x, int y) { return s[x] > s[y]; });
	for(int i = 1; i <= m; i++) {
		cin >> edge[i].x >> edge[i].y;
		edge[i].w = max(c[edge[i].x], c[edge[i].y]);
	}
	sort(edge + 1, edge + m + 1, [](Edge x, Edge y) { return x.w < y.w; });
	tot = n;
	for(int i = 1; i <= n; i++) fa[i] = i;
	for(int i = 1; i <= m; i++) {
		int x = edge[i].x, y = edge[i].y, w = edge[i].w;
		x = find(x), y = find(y); if(x == y) continue;
		++tot, fa[x] = fa[y] = fa[tot] = tot, c[tot] = w;
		e[tot].push_back(x), e[tot].push_back(y);
	}
	dfs(tot, 0);
	for(int i = 1; i <= n; i++) {
		int u = id[i], x = u;
		for(int j = 19; ~j; j--) {
			if(!f[x][j]) continue;
			if(c[f[x][j]] <= t[u]) x = f[x][j];
		}
		for(;;) {
			set<pair<int, int> >::iterator it = st.lower_bound({dfn[x], 0});
			if(it == st.end() || it->first > low[x]) break;
			ans[it->second] = s[u];
			st.erase(it);
		}
	}
	for(int i = 1; i <= n; i++) cout << ans[i] << " \n"[i == n];
	return 0;
}