#include <bits/stdc++.h>
#define for0(i,n) for(int i=0; i<n; i++)
#define for1(i,n) for(int i=1; i<=n; i++)
#define pb push_back
#define mp make_pair
#define all(v) v.begin(), v.end()
#define V vector<int>
#define VP vector<pair<int, int> >
#define clr(A,x) memset(A, x, sizeof(A))
#define cpy(A,B) memcpy(A, B, sizeof(B))
#define g(s) getline(cin, s) ///ai grija la fin/cin ///
#define FASTIO ios_base::sync_with_stdio(0)
#define INF 0x3f3f3f3f
typedef long long ll;
typedef unsigned long long ull;
using namespace std;
/*template <typename T>
string to_string(const T& n){
    ostringstream os;
    os << n;
    return os.str();
}
*/

/*struct coord
{
    int x,y;

};
bool operator<(const coord &l, const coord &r)
{
    return (l.x<r.x || (l.x==r.x && l.y<r.y));
}*/

/*void invers_modular(int a, int b, int& d, int& x, int & y)
{
    if(!b)
    {
        d=a;
        x=1;
        y=0;
        return ;
    }
    int x0, y0;
    invers_modular(b, a%b, d, x0, y0);
    x=y0;
    y=x0-a/b*y0;
} // daca x<0 se aduna cu mod pana e mai mare, x fiind rezultatul*/

/*ull p(int baze, int exponent)
{
    if(exponent==0)
        return 1;

    if(exponent%2==0)
        return p(baze*baze, exponent/2);
    else return baze*p(baze, exponent-1);
}*/
//ifstream fin("bellmanford.in"); /// modifica cu numele corespunzator
//ofstream fout("bellmanford.out"); /// modifica cu numele corespunzator

int verificam_ciclu[50001];
int n, m;
int a, b, c;
unordered_map<int, int> drum_nod;
vector<vector<pair<int,int> > > lista(50001);

int main()
{
    freopen("bellmanford.in", "r", stdin);
    freopen("bellmanford.out", "w", stdout);
    scanf("%d %d ", &n, &m);
    for1(i,m)
    {
        scanf("%d %d %d ", &a, &b, &c);
        lista[a].pb(mp(b,c));
    }
    for1(i,n)
        drum_nod[i]=INF;

    queue<int> coada;
    coada.push(1), drum_nod[1]=0;
    while(!coada.empty())
    {
        int actual=coada.front();
        coada.pop();

        verificam_ciclu[actual]++;
        if(verificam_ciclu[actual]>n)
        {
            printf("Ciclu negativ!");
            return 0;
        }

        for(auto i: lista[actual])
            if(drum_nod[i.first]>drum_nod[actual]+i.second)
            {
                drum_nod[i.first]=drum_nod[actual]+i.second;
                coada.push(i.first);
            }
    }

    for(int i=2; i<=n; i++)
        printf("%d ", drum_nod[i]);

    return 0;
}