#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned long long
#define i128 __int128
#define pii pair<int, int>
#define pll pair<ll, ll>
#define all(x) (x).begin(), (x).end()
bool be;
constexpr int N = 1e6 + 5;
int n, m, a[N];
ll d[N];
bool vis[N];
vector<pii>e[N];
void solve()
{
	priority_queue<pii>q;
	for (int i = 1; i <= n; ++i) q.emplace(d[i], i);
	while (!q.empty()) {
		int u = q.top().second;
		q.pop();
		if (vis[u]) continue;
		vis[u] = 1;
		for (auto [v, w] : e[u]) {
			if (d[v] < d[u] - w) {
				q.emplace(d[v] = d[u] - w, v);
			}
		}
	}
}
bool en;
int main()
{
#ifdef IAKIOI
	cerr << (&be - &en) / 1024.0 / 1024 << " MB\n----------------------------" << endl;
	freopen("in.in", "r", stdin);
	// freopen("out.out", "w", stdout);
#endif
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	cin >> n >> m;
	for (int i = 1; i <= n; ++i) cin >> a[i], d[i] = a[i];
	for (int i = 1; i <= m; ++i) {
		int u, v, w;
		cin >> u >> v >> w;
		e[u].emplace_back(v, w);
		e[v].emplace_back(u, w);
	}
	solve();
	for (int i = 1; i <= n; ++i) cout << d[i] << '\n';
	return 0;
}