#include <bits/stdc++.h>
using namespace std;

const int N = 100005;

struct edge{
	int v,w,next;
}e[N];
int s[N],t[N],head[N],cnt;
int n,m,c;
queue<int> q;
void add(int u,int v,int w){
	e[++cnt].v=v;
 	e[cnt].w=w;
 	e[cnt].next=head[u];
 	head[u]=cnt;
}
int main(){
	freopen("timeline.in","r",stdin);
 	freopen("timeline.out","w",stdout);
	scanf("%d%d%d",&n,&m,&c);
 	for(int i=1;i<=n;i++)scanf("%d",&s[i]);
 	for(int i=1;i<=c;i++){
  		int u,v,w;
  		scanf("%d%d%d",&u,&v,&w);
  		add(u,v,w);
  		t[v]++;
	}
 	for(int i=1;i<=n;i++)if(!t[i])q.push(i);
 	while(!q.empty()){
  		int u=q.front();
  		q.pop();
  		for(int i=head[u];i;i=e[i].next){
   			int v=e[i].v,w=e[i].w;
   			s[v]=max(s[v],s[u]+w);
   			t[v]--;
   			if(!t[v])q.push(v);
  		}
 	}
 	for(int i=1;i<=n;i++)cout<<s[i]<<endl;
 	return 0;
}