#include <bits/stdc++.h>
using namespace std;
int n, m, c;
vector<pair<int, int> > g[100005];
int d[100005];
int s[100005];
bool vis[100005];
void spfa(int s) {
  memset(d, 0, sizeof(d));
  memset(vis, 0, sizeof(vis));
  deque<int> q;
  q.push_back(s);
  vis[s] = true;
  d[s] = 0;
  d[0] = 0;
  while (!q.empty()) {
    int x = q.front();
    q.pop_front();
    vis[x] = 0;
    for (int i = 0; i < g[x].size(); i++) {
      int y = g[x][i].first, w = g[x][i].second;
      if (d[y] < d[x] + w) {
        d[y] = d[x] + w;
        if (!vis[y]) q.push_front(y), vis[y] = true;
      }
    }
  }
}
int main() {
  freopen("usaco_Feb_timeline.in", "r", stdin);
  freopen("usaco_Feb_timeline.out", "w", stdout);
  cin >> n >> m >> c;
  for(int i = 1; i <= n; i++) {
    cin >> s[i];
    g[0].push_back({i, s[i]});
  }
  for(int i = 1; i <= c; i++) {
    int a, b, x;
    cin >> a >> b >> x;
    g[a].push_back({b, x});
  }
  //for(int i = 1; i <= n; i++) g[n + 1].push_back({i, 0});
  spfa(0);
  for(int i = 1; i <= n; i++) cout << d[i] << endl;
  return 0;
}