#include <cstdio>
# include <cstring>
# include <queue>
# define MAXINT 0x7FFFFFFF
# include <vector>
# include <algorithm>
using namespace std;

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