#include <fstream>
#include <vector>
#include <queue>

using namespace std;

ifstream f("bellmanford.in");
//ifstream f(".\\Teste\\grader_test8.in");
ofstream g("bellmanford.out");

const int NMAX = 50001, //MMAX = 250001,
          INF = 1 << 29;

struct muchie
{
    int y, w;
};

int N, M,
    D[NMAX],  ///D[i] = distanta minima de la nodul sursa la i
    nrViz[NMAX];
vector<muchie> G[NMAX];
queue<int> Q;
bool inQ[NMAX]; ///inQ[i]==1 daca nodul i este in coada

void citire()
{
    int x, y, w;
    f >> N >> M;
    for(int i = 1; i <= M; ++i)
    {
        f >> x >> y >> w;
        G[x].push_back({y, w});
    }
}

void init(int s)
{
    for(int i = 1; i <= N; i++)
        D[i] = INF;
    D[s] = 0;
}

bool BellmanFord(int s)///Varianta 3 (putem avea și ciclu de cost negativ)
{
    int crt, dest, cost;
    init(s);
    Q.push(s);
    inQ[s] = 1;
    while(!Q.empty())
    {
        crt = Q.front();
        Q.pop();
        inQ[crt] = 0;
        for(muchie &m : G[crt])
        {
            cost = D[crt] + m.w;
            dest = m.y;
            if(cost < D[dest])
            {
                D[dest] = cost;
                if(inQ[dest] == 0)
                {
                    Q.push(dest);
                    inQ[dest] = 1;
                    nrViz[dest]++;
                    if(nrViz[dest] >= N)
                        return 0;
                }
            }
        }
    }
    return 1;
}

int main()
{
    citire();
    if(BellmanFord(1))
    {
        for(int i = 2; i <= N; i++)
            g << D[i] << ' ';
    }
    else
        g << "Ciclu negativ!";
    f.close();
    g.close();
    return 0;
}