#include<iostream>
#include<vector>
#include<queue>
#include<fstream>
using namespace std;

int oo = (1 << 30);
int D[50005];
int n, m;
ifstream fin("bellmanford.in");
ofstream fout("bellmanford.out");

struct cmp
{
    bool operator()(int x, int y)
    {
        return D[x] > D[y];
    }

};
priority_queue<int,vector<int>, cmp> coada;

vector<pair<int,int>> V[250005];
bool inCoada[50005];
int viz[50005];
void citire()
{
    fin >> n >> m;
    for(int i = 0; i <m; i++)
    {
        int x, y,c;
        fin >> x >> y >> c;
        V[x].push_back(make_pair(y,c));
    }
}
bool dijkstra(int nodStart)
{
    for(int i = 1; i <= n; i++)
        D[i] = oo;
    D[nodStart] = 0;
    coada.push(nodStart);
    inCoada[nodStart] = true;
    viz[nodStart] = 1;
    while(!coada.empty())
    {

        int c = coada.top();
        viz[c]++;
        if(viz[c] >= n)
        {

        }
        coada.pop();
        inCoada[c] = false;
        for(size_t i = 0;i < V[c].size(); i++ )
        {

            int vecin = V[c][i].first;
            int cost = V[c][i].second;
            if(D[c] + cost < D[vecin])
            {
                D[vecin] = D[c] + cost;
                if(inCoada[vecin] == false)
                {
                   // inCoada[vecin] = true;
                    coada.push(vecin);
                }
            }
        }
    }
    return true;


}

void afisare()
{
    for(int i = 2; i <= n; i++)
    {
        fout << D[i] << " ";
    }

}
int main()
{
    citire();
    if(dijkstra(1))
    {
         afisare();
    }
    else
        fout << "Ciclu negativ!";




}