#include <iostream>
#include <cstdio>
#include <algorithm>
#include <queue>
#include <map>
#define ll long long
using namespace std;
const int N=1e6+5;
ll head[N],nxt[N*2],to[N*2],vl[N*2],num=0;
void add(int x,int y,ll z){
	num++;
	to[num]=y;
	vl[num]=z;
	nxt[num]=head[x];
	head[x]=num;
}
ll dis[N];
ll s[N];
priority_queue<pair<ll,int> >q;
int main(){
	freopen("usaco_Feb_timeline.in","r",stdin);
	freopen("usaco_Feb_timeline.out","w",stdout);
	int n,m,c;
	cin>>n>>m>>c;
	for(int i=1;i<=n;i++){
		cin>>s[i]; 
		add(0,i,s[i]);    // 可以选择把最小值放到边上，这样子一定会经过并算上 
	}
	for(int i=1;i<=c;i++){
		ll u,v,w;
		cin>>u>>v>>w;
		add(u,v,w);
	}
	q.push(make_pair(0,0));
	while(!q.empty()){
		int u=q.top().second,now=q.top().first;
		q.pop();
		if(now<dis[u]) continue;
		for(int i=head[u];i;i=nxt[i]){
			int v=to[i];
			if(dis[u]+vl[i]>dis[v]){
				dis[v]=dis[u]+vl[i];
				q.push(make_pair(dis[v],v));
			}
		}
	}
	for(int i=1;i<=n;i++){
		cout<<dis[i]<<endl;
	}
	return 0;
}