#include<bits/stdc++.h>
#define ll long long
using namespace std;
const int N=1e5+10;
int n,m,c;
vector<int> g[N];
vector<int> e[N];
int d[N],vis[N];
queue<int> q;
int main()
{
    freopen("usaco_Feb_timeline.in","r",stdin);
    freopen("usaco_Feb_timeline.out","w",stdout);
    
    cin>>n>>m>>c;
    for(int i=1;i<=n;i++){
        int w;
        cin>>w;
        g[0].push_back(i),e[0].push_back(w);
    }
    for(int i=1;i<=c;i++)
    {
        int x,y,w;
        cin>>x>>y>>w;
        g[x].push_back(y),e[x].push_back(w);
    }
    q.push(0),vis[0]=true,d[0]=0;
    while(!q.empty())
    {
        int x=q.front();
        q.pop();
        vis[x]=0;
        for(int i=0;i<g[x].size();i++)
        {
            int y=g[x][i],w=e[x][i];
            if(d[y]<d[x]+w)
            {
                d[y]=d[x]+w;
                if(!vis[y]) q.push(y),vis[y]=true;
            }
        }
    }
    for(int i=1;i<=n;i++) cout<<d[i]<<endl;
    return 0;
}