#include <cstdio>
#include <vector>
#include <queue>
#define INF 10000000
using namespace std;
struct bellman
{
    vector <int> nod, cost;
};
bellman g[50001];
queue <int> q;
int Cost[50001], nrit[50001], n;
bool sel[50001], ciclu;
void bellmanford (int x)
{
    int i, nod; sel[x]=true; q.push(x);
    for (i=1; i<=n; i++) if (i!=x) Cost[i]=INF;
    while (!q.empty())
    {
        nod=q.front();
        q.pop();
        sel[nod]=false;
        for (i=0; i<g[nod].nod.size(); i++)
        {
            if (Cost[nod]+g[nod].cost[i]<Cost[g[nod].nod[i]])
            {
                Cost[g[nod].nod[i]]=Cost[nod]+g[nod].cost[i];
                if (!sel[g[nod].nod[i]])
                {
                    sel[g[nod].nod[i]]=true;
                    q.push(g[nod].nod[i]);
                    nrit[g[nod].nod[i]]++;
                    if (nrit[g[nod].nod[i]]>n)
                    {
                        printf("Ciclu negativ!");
                        ciclu=true;
                        return;
                    }
                }
            }
        }
    }
}
int main()
{
    int m, i, x, y, z;
    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",&x,&y,&z);
        g[x].nod.push_back(y);
        g[x].cost.push_back(z);
    }
    bellmanford(1); if (ciclu) return 0;
    for (i=2; i<=n; i++) printf("%d ",Cost[i]);
    return 0;
}