#include <iostream>
#include <vector>
#include <cstring>
#include <cstdio>

#define INF 0x3f3f3f3f
#define NMax 50005
using namespace std;

int n,m,x,y,c;
vector<pair<int,int> > vecini[NMax];

int check_negative(int dist[NMax]){
    for(int nod = 1; nod <= n; nod++){
        for(int j = 0; j < vecini[nod].size(); j++){
            if(dist[vecini[nod][j].first] > dist[nod] + vecini[nod][j].second){
                printf("Ciclu negativ!");
                return 1;
            }
        }
    }
    return 0;
}
void bellmanford(int x0){
    int dist[NMax],viz[NMax];

    memset(dist,INF,sizeof(dist));
    memset(viz,0,sizeof(viz));

    dist[x0] = 0;
    int ok = 1;

    for(int count = 1; count <= n - 1; count++){

        for(int nod = 1; nod <= n; nod++){
            for(int i = 0; i < vecini[nod].size(); i++){
                if(dist[vecini[nod][i].first] > dist[nod] + vecini[nod][i].second){
                    dist[vecini[nod][i].first] = dist[nod] + vecini[nod][i].second;
                }
            }
        }
    }
    if(!check_negative(dist)){
        for(int i = 2; i <= n; i++){
            printf("%d ",dist[i]);
        }
    }
}
int main()
{
    freopen("bellmanford.in","r",stdin);
    freopen("bellmanford.out","w",stdout);
    scanf("%d%d",&n,&m);
    for(int i = 1; i <= m; i++){
        scanf("%d%d%d",&x,&y,&c);
        vecini[x].push_back(make_pair(y,c));
    }
    bellmanford(1);

    return 0;
}