#include <fstream>
#include <vector>
#include <queue>
#define INF 10000001
using namespace std;

ifstream cin("bellmanford.in");
ofstream cout("bellmanford.out");
vector <int> G[50001],C[50001];
int d[50001],ciclu[50001],n,m;
int bellmanford(int start)
{
    queue <int> que;
    que.push(start);
    while(!que.empty())
    {
        int v = que.front();
        ciclu[v]++;
        if(ciclu[v]>n) return -1;
        for(unsigned int i=0; i<G[v].size(); ++i)
        {
            int j = G[v][i];
            if(d[j]>d[v]+C[v][i])
            {
                d[j] = d[v]+C[v][i];
                que.push(j);
            }
        }
        que.pop();
    }
    return 1;
}
int main()
{
    cin>>n>>m;
    while(m--)
    {
        int x,y,c;
        cin>>x>>y>>c;
        G[x].push_back(y);
        C[x].push_back(c);
    }
    for(int i=2;i<=n;++i)
        d[i]=INF;
    int nr = bellmanford(1);
    if(n<0)
    {
        cout<<"Ciclu negativ!";
    }
    else
    {
        for(int i=2;i<=n;i++)
            cout<<d[i]<<' ';
    }
}