#include <bits/stdc++.h>
#define oo 1<<30
#define cin fin
#define cout fout
using namespace std;
ifstream cin ("bellmanford.in");
ofstream cout ("bellmanford.out");
vector<pair<int,int>>G[50008];
int v[50008],grad[50008],n,m,i,a,b,c;
queue<int>Q;
int bellman(int nodstart)
{
    for(i=1;i<=n;i++)
        v[i]=oo;
    v[nodstart]=0;
    Q.push(nodstart);
    while(!Q.empty())
    {
        int k=Q.front();
        Q.pop();
        for(auto i:G[k])
        {
            if(v[i.first]>v[k]+i.second)
            {
                v[i.first]=v[k]+i.second;
                grad[i.first]++;
                Q.push(i.first);
                if(grad[i.first]==n)
                    return 0;
            }
        }
    }
}
int main()
{
    cin>>n>>m;
    for(i=1;i<=m;i++)
    {
        cin>>a>>b>>c;
        G[a].push_back(make_pair(b,c));
    }
    if(bellman(1))
    {
        for(i=2;i<=n;i++)
            cout<<v[i]<<" ";
    }
    return 0;
}