#include <bits/stdc++.h>
using namespace std;
using i64 = long long;
using ll = long long;
#define pb emplace_back
#define X first
#define Y second
#define AI(i) begin(i), end(i)
template<class T> bool chmax(T &a, T b) { return a < b && (a = b, true);}
template<class T> bool chmin(T &a, T b) { return b < a && (a = b, true);}
#ifdef KEV
#define DE(args...) kout("[ " + string(#args) + " ] = ", args)
void kout() { cerr << endl; }
template<class T, class ...U> void kout(T a, U ...b) { cerr << a << ' ', kout(b...); }
template<class T> void debug(T l, T r) { while (l != r) cerr << *l++ << " \n"[l==r]; }
#else
#define DE(...) 0
#define debug(...) 0
#endif

struct DSU {
	int n;
	vector<int> fa, sz;
	DSU(int n) : n(n), fa(n), sz(n, 1) {
		iota(fa.begin(), fa.end(), 0);
	}
	int find(int u) {
		return u == fa[u] ? u : find(fa[u]);
	}
	bool join(int u, int v) {
		u = find(u), v = find(v);
		if (u == v) {
			return false;
		}
		sz[u] += sz[v];
		fa[v] = u;
		return true;
	}
};

const int MAX_N = 300010;
int main() {
	ios_base::sync_with_stdio(0), cin.tie(0);

	int n, m;
	cin >> n >> m;

	vector<int> h(n);
	for (int i = 0; i < n; i++) {
		cin >> h[i];
	}

	vector<array<int, 3>> e(m);
	for (auto &[w, u, v] : e) {
		cin >> u >> v;
		u--, v--;
		w = abs(h[u] - h[v]);
	}

	sort(e.begin(), e.end());

	vector<vector<int>> tree(n + 1);
	vector<array<int, 3>> nontree;
	DSU d(n);

	for (auto [w, u, v] : e) {
		if (d.join(u, v)) {
			tree[u].push_back(v);
			tree[v].push_back(u);
		} else {
			nontree.push_back({w, u, v});
		}
	}
	tree[n].push_back(0);

	vector<int> par(n + 1, -1), dep(n + 1);
	auto dfs = [&](auto dfs, int u, int p) -> void {
		par[u] = p;
		for (auto v : tree[u]) {
			if (v == p) {
				continue;
			}
			dep[v] = dep[u] + 1;
			dfs(dfs, v, u);
		}
	};
	dfs(dfs, n, -1);

	debug(dep.begin(), dep.end());

	vector<int> ans(n, -1);
	d = DSU(n + 1);

	for (auto [w, u, v] : nontree) {
		DE(w, u + 1, v + 1);
		u = d.find(u), v = d.find(v);
		while (u != v) {
			if (dep[u] < dep[v]) {
				swap(u, v);
			}
			ans[u] = w;
			d.join(par[u], u);
			u = d.find(u);
		}
		if (u != n) {
			ans[u] = w;
			d.join(par[u], u);
		}
	}

	for (int i = 0; i < n; i++) {
		cout << ans[i] << " \n"[i == n - 1];
	}
}