#include<bits/stdc++.h>

#define fastio ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define ll long long
#define pii pair<int,int>
#define pill pair<int,ll>
#define pll pair<ll,ll>
#define pb push_back
#define fi first
#define se second
#define ff fi.fi
#define fs fi.se
#define sf se.fi
#define ss se.se
#define MASK(x) (((1)<<(x))-1)
#define getbit(x,k) (((x)>>(k))&1)

using namespace std;

const int maxn=2e5+5,mod=1e9+7;
const ll inf=1e18;

int n,m;
vector<pii>eg[maxn];
ll d[maxn],ans[maxn];
bool id[maxn];
priority_queue<pll,vector<pll>,greater<pll>>pQ;


void dijkstra()
{
    while(pQ.size())
    {
        pll u=pQ.top();pQ.pop();
        if(u.fi!=d[u.se]) continue;
        for(pii v:eg[u.se]) if(u.fi+v.se<d[v.fi])
        {
            d[v.fi]=u.fi+v.se;
            pQ.push({d[v.fi],v.fi});
        }
    }
}
void solve(int tp)
{
    fill(d+1,d+1+n,inf);
    for(int i=1;i<=n;i++) if(id[i]==tp)
    {
        pQ.push({0,i});
        d[i]=0;
    }
    dijkstra();
    for(int i=1;i<=n;i++) if(d[i] && d[i]!=inf) ans[i]=d[i];
}
int main()
{
    cin>>n>>m;
    for(int i=1;i<=n;i++) cin>>id[i];
    for(int i=1;i<=m;i++)
    {
        int u,v,c;cin>>u>>v>>c;
        eg[v].pb({u,c});
    }
    memset(ans,-1,(n+1)*sizeof(ll));
    solve(0);solve(1);
    for(int i=1;i<=n;i++) cout<<ans[i]<<'\n';
}