#include <cstdio>
#include <queue>
#include <utility>
typedef long long ll;

void ParseIn();
void Core();
void WriteOut();

int main() {
  freopen("usaco_Feb_timeline.in", "r", stdin);
  freopen("usaco_Feb_timeline.out", "w", stdout);

  ParseIn();
  Core();
  WriteOut();

  return 0;
}

template <typename T> T read();
template <typename T> void write(T, char);
void AddEdge(int, int, ll);
void Dijkstra();

const int MAXN = 1e5 + 10;

int m, n, c;
int gin[MAXN];
ll dis[MAXN];
::std::priority_queue<::std::pair<ll, int>> pq;

struct EDGE {
  int v;
  ll w;
  int next;
} edge[MAXN << 1];

int head[MAXN], edgeNum;
void Dijkstra() {
  while (!pq.empty()) {
    int u = pq.top().second;
    pq.pop();
    for (int i = head[u]; i; i = edge[i].next) {
      int v = edge[i].v;
      ll w = edge[i].w;
      if (dis[u] + w > dis[v]) {
        dis[v] = dis[u] + w;
        pq.push(::std::make_pair(dis[v], v));
      }
    }
  }
}

void ParseIn() {
  n = read<int>(), m = read<int>(), c = read<int>();
  for (int i = 1; i <= n; ++i) {
    dis[i] = read<ll>();
  }
  for (int i = 1; i <= c; ++i) {
    int u = read<int>(), v = read<int>();
    gin[v]++;
    ll w = read<ll>();
    AddEdge(u, v, w);
  }
}

void Core() {
  for (int i = 1; i <= n; ++i) {
    if (!gin[i]) pq.push(::std::make_pair(dis[i], i));
  }
  Dijkstra();
}

void WriteOut() {
  for (int i = 1; i <= n; ++i) {
    write(dis[i], '\n');
  }
}

void AddEdge(int u, int v, ll w) {
  edge[++edgeNum] = {v, w, head[u]};
  head[u] = edgeNum;
}

#define isdigit(ch) (ch >= '0' && ch <= '9')
template <typename T> T read() {
  T res = 0, f = 1;
  char ch = getchar();
  for (; !isdigit(ch); ch = getchar())
    if (ch == '-') f = -1;
  for (; isdigit(ch); ch = getchar()) res = (res << 3) + (res << 1) + (ch ^ 48);
  return res * f;
}
#undef isdigit

template <typename T> void write(T x, char ed) {
  if (x < 0) x = -x, putchar('-');
  int sta[sizeof(T) << 2], top = 0;
  do {
    sta[++top] = x % 10;
    x /= 10;
  } while (x);
  while (top) {
    putchar(sta[top--] ^ 48);
  }
  putchar(ed);
}