#include <fstream>
#include <vector>
#include <queue>
#include <bitset>
#include <cstring>
#define INF 1000000000

using namespace std;

ifstream fin("bellmanford.in");
ofstream fout("bellmanford.out");

vector< pair<int,int> > v[50001];
queue<int> q;
int f[50001];

int c[50001];

int main()
{
    int n,m,x,y,dc;
    fin>>n>>m;
    for(int i=1;i<=m;i++)
    {
        fin>>x>>y>>dc;
        v[x].push_back(make_pair(y,dc));
    }
    for(int i=1;i<=n;i++)
        c[i]=INF;
    int curent = 1;
    c[1]=0;
    q.push(1);
    f[1]=1;
    while(!q.empty())
    {
        curent = q.front();
        for(int j=0;j<v[curent].size();j++)
        {
            if(c[curent]!=INF)
                if(v[curent][j].second + c[curent] < c[v[curent][j].first])
                {
                    c[v[curent][j].first]=v[curent][j].second + c[curent];
                    //if(!used[v[curent][j].first])
                    q.push(v[curent][j].first);

                    if( f[v[curent][j].first] > n)
                    {
                        fout<<"Ciclu negativ!\n";
                        return 0;
                    }
                    f[v[curent][j].first]++;
                }
        }
        q.pop();
    }


    /*for(int i=1;i<=n;i++)
        for(int j=0;j<v[i].size();j++)
            if(c[v[i][j].first]!=INF && c[v[i][j].first] > c[i]+v[i][j].second)
            {
                fout<<"Ciclu negativ! " <<i<<' '<<v[i][j].first<<'\n';
                return 0;
            }
    */
    for(int i=2;i<=n;i++)
        fout<<c[i]<<' ';
    fout<<'\n';
    fin.close();
    fout.close();
    return 0;
}