#include <iostream>
#include <cstdio>
#include <queue>
using namespace std;
const int N=1e5+10;
const int M=2e5+10;
int ver[N],to[M],nxt[M],val[M],idx;
int n,f[N],ind[N],m,c;
queue<int>q;
void add(int x,int y,int z){
	to[++idx]=y,nxt[idx]=ver[x],ver[x]=idx,val[idx]=z;
}
int main(){
	freopen("usaco_Feb_timeline.in","r",stdin);
	freopen("usaco_Feb_timeline.out","w",stdout); 
	scanf("%d %d %d",&n,&m,&c);
	for(int i=1;i<=n;i++)scanf("%d",f+i);
	for(int i=1,u,v,w;i<=c;i++){
		scanf("%d %d %d",&u,&v,&w);
		add(u,v,w);ind[v]++;
	}
	for(int i=1;i<=n;i++){
		if(!ind[i])q.push(i);
	}
	while(q.size()){
		int x=q.front();q.pop();
		for(int i=ver[x];i;i=nxt[i]){
			int y=to[i];
			f[y]=max(f[y],f[x]+val[i]);
			ind[y]--;
			if(!ind[y])q.push(y);
		}
	}
	for(int i=1;i<=n;i++){
		printf("%d\n",f[i]);
	}
	return 0;
}