#include <bits/stdc++.h>

using namespace std;

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

vector <pair <int,int> > v[50100];
int n,dist[50100],fv[50100];
priority_queue < pair <int,int>, vector < pair <int,int> >, greater < pair <int,int > > > q;

void Bellman_Ford(int start_nod)
{
    int i;

    for(i=1;i<=n;i++)dist[i]=INT_MAX/2;
    dist[start_nod]=0;
    q.push({0,start_nod});

    while(!q.empty())
    {
        int nod=q.top().second;
        q.pop();

        if(fv[nod]>=n)
        {
            g<<"Ciclu negativ!";
            exit(0);
        }

        for(i=0;i<v[nod].size();i++)
        {
            int vecin=v[nod][i].first;
            int cost_intre=v[nod][i].second;

            if(dist[vecin]>dist[nod]+cost_intre)
            {
                dist[vecin]=dist[nod]+cost_intre;
                fv[vecin]++;
                q.push({dist[vecin],vecin});
            }
        }
    }
}

int m,i,x,y,cost;
int main()
{
    f>>n>>m;
    for(i=1;i<=m;i++)
    {
        f>>x>>y>>cost;
        v[x].push_back({y,cost});
    }

    Bellman_Ford(1);

    for(i=2;i<=n;i++)
        g<<dist[i]<<" ";
    return 0;
}