#include<iostream>
#include<queue>
using namespace std;

const int MAXN = 1e5 + 5;
const int IINF = 2147483646;
int n, m ,c;
struct node{
	int to, next, len;
}e[MAXN * 2];
int h[MAXN], tot = 0, d[MAXN];
bool vis[MAXN];
void add(int x, int y, int len){
	e[++ tot] = {y, h[x], len};
	h[x] = tot;
}
queue<int> q;
void SPFA(int s){
    for(int i = 0;i <= n;i ++){
        d[i] = IINF;
    }
    d[s] = 0, vis[s] = 1;
    q.push(s);
    while(!q.empty()){
        int u = q.front();
        q.pop();
        vis[u] = 0;
        for(int i = h[u];i;i = e[i].next){
            int v = e[i].to;
            int w = e[i].len;
            if(d[v] > d[u] + w){
                d[v] = d[u] + w;
                if(!vis[v]){
                    q.push(v);
                    vis[v] = 1;
                }
            }
        }
    }
}

int main(){
	freopen("usaco_Feb_timeline.in","r",stdin);
	freopen("usaco_Feb_timeline.out","w",stdout);
	cin >> n >> m >> c;
	
	for(int i = 1, x;i <= n;i ++){
		cin >> x;
		add(0, i, -x);
	}
	for(int i = 1, a, x, b;i <= c;i ++){
		cin >> a >> b >> x;
		add(a, b, -x);
	}
	
	SPFA(0);
	
	for(int i = 1;i <= n;i ++){
		cout << -d[i] << '\n';
	}
	return 0;
}