#include <fstream>
#include <vector>
#include <queue>
#include <stdlib.h>
#define  infinit 999999999

using namespace std;

ifstream f("bellmanford.in");
ofstream g("bellmanford.out");

struct varf{
    int vecin, cost;
};
queue <int>q;
vector <varf> graph[50005];

int x, y, c, n, m, dmin[50005];//, pusInCoada[50005], nrActualizari[50005];

int bellman_ford()
{
    int sursa = 1;
    for(int i=1; i <= n; i++)
    {
        dmin[i] = infinit;
    }
    dmin[sursa] = 0;
    for(int i=1; i<n; i++)
    {
        for(int j=1; j<=n; j++)
        {
            for(auto& v:graph[j])
            {
                int vd = v.vecin;
                int w = v.cost;
                if(dmin[vd] > dmin[j] + w)
                {
                    dmin[vd] = dmin[j] + w;
                }
            }
        }
    }
    for(int j=1; j<=n; j++)
    {
        for(auto& v:graph[j])
        {
            int vd = v.vecin;
            int w = v.cost;
            if(dmin[vd] > dmin[j] + w)
            {
                return false;
            }
        }
    }
    return true;
}

int main()
{
    f>>n>>m;

    for(int i=1; i<=m; i++)
    {
        f>>x>>y>>c;
        graph[x].push_back({y, c});
    }
    if(bellman_ford() == false)
    {
        g<<"Ciclu negativ!";
    }
    for(int  i=2; i<=n; i++)
        g<<dmin[i]<<' ';
    return 0;
}