#include <iostream>
#include <cstdio>
#include <vector>
#include <queue>
#define inf 50000050

using namespace std;

vector< vector< pair<int,int> > >g(50050);
queue<int> q;

bool in[50050];
int nr[50050];
int best[50050];

int main()
{
    freopen("bellmanford.in","r",stdin);
    freopen("bellmanford.out","w",stdout);
    int n,m,i,x,y,c,node;
    scanf("%d%d",&n,&m);
    for(i=1;i<=m;i++)
    {
        scanf("%d%d%d",&x,&y,&c);
        g[x].push_back(make_pair(y,c));
    }
    for(i=1;i<=n;i++)
        best[i]=inf;
    best[1]=0;
    in[1]=true;
    q.push(1);
    while(!q.empty())
    {
        node=q.front();
        q.pop();
        in[node]=false;
        for(i=0;i<g[node].size();i++)
        {
            if(best[g[node][i].first]>best[node]+g[node][i].second)
            {
                best[g[node][i].first]=best[node]+g[node][i].second;
                if(in[g[node][i].first]==false)
                {
                    if(nr[g[node][i].first]>n)
                    {
                        printf("Ciclu infinit!");
                        return 0;
                    }
                    in[g[node][i].first]=true;
                    nr[g[node][i].first]++;
                    q.push(g[node][i].first);
                }
            }
        }
    }
    for(i=2;i<=n;i++)
        printf("%d ",best[i]);
    return 0;
}