#include <cstdio>
# include <vector>
# include <queue>
#define MAXINT 0x7FFFFFFF

using namespace std;
vector < pair <int, int> > v[50010];
queue <int> q;
int n,m,i,a,b,c,d[50010],vecin,cost,nod1[50010],nod,tata[50010];
bool use[50010];
int main()
{
    freopen("bellmanford.in","r",stdin);
    freopen("bellmanford.out","w",stdout);
    scanf("%d %d",&n,&m);
    for (i=1; i<=m; i++)
    {
        scanf("%d %d %d\n",&a,&b,&c);
        v[a].push_back(make_pair(c,b));
    }
    for (i=1; i<=n; i++)
         d[i]=MAXINT;
    d[1]=0;
    q.push(1);
    use[1]=true;
    while (!q.empty())
    {
        nod=q.front();
        q.pop();
        use[nod]=false;
        for (i=0; i<v[nod].size(); i++)
        {
            vecin=v[nod][i].second;
            cost=v[nod][i].first;
            if (d[vecin]>d[nod]+cost)
            {
                d[vecin]=d[nod]+cost;
                if (use[vecin]==false)
                {
                    use[vecin]=true;
                    q.push(vecin);
                    tata[vecin]=nod;
                    nod1[vecin]++;
                    if (nod1[vecin]>n)
                    {
                        printf("Ciclu negativ!\n");
                        return 0;
                    }
                }
            }
        }
    }
    for (i=2; i<=n; i++)
         printf("%d ",d[i]);
    return 0;
}