#include <bits/stdc++.h>
#define ll long long
#define all(a) (a).begin(), (a).end()
//#pragma GCC optimize("O3")
//#pragma GCC optimize("Ofast")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define sz() size()
#define fr first
#define sc second
#define pb push_back
#define er erase
#define in insert
#define pi pair<int,int>
#define pii pair<pair<int,int>,int>
#define mp make_pair
//#define int long long
#define rc(s) return cout<<s,0
#define rcc(s) cout<<s,exit(0)
using namespace std;

const int mod=1e9+7;
const int modx=998244353;
const int per=666013;

const int inf=1e9;

int n,m,x,y,z,dist[50005];
vector<pair<pair<int,int>,int>>edges;

bool cmp(pair<pair<int,int>,int> a1,pair<pair<int,int>,int> a2){
    return a1.sc<a2.sc;
}

int32_t main(){
	//ios_base::sync_with_stdio(false);cin.tie(0);cerr.tie(0);cout.tie(0);
    //srand(chrono::steady_clock::now().time_since_epoch().count());
    ifstream fin("bellmanford.in");
    ofstream fout("bellmanford.out");
    fin >> n >> m;
    for(int i=1;i<=m;i++){
        fin >> x >> y >> z;
        edges.push_back({{x,y},z});
    }
    dist[0]=0;
    for(int i=2;i<=n;i++) dist[i]=inf;
    sort(all(edges),cmp);
    for(int i=1;i<=n-1;i++){
        for(pair<pair<int,int>,int> it:edges){
            if(dist[it.fr.fr]!=inf && dist[it.fr.fr]+it.sc<dist[it.fr.sc]) dist[it.fr.sc]=dist[it.fr.fr]+it.sc;
        }
    }
    for(pair<pair<int,int>,int> it:edges){
            if(dist[it.fr.fr]!=inf && dist[it.fr.fr]+it.sc<dist[it.fr.sc]) rc("Ciclu negativ!");
    }
    for(int i=2;i<=n;i++) fout << dist[i] << ' ';
}