#include <cstdio>
#include <vector>
#include <cstring>
#include <queue>
#include <algorithm>
#include <cmath>
#include <set>
#include <iomanip>
#include <fstream>
#include <iostream>

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

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

void bf(int x0){
    memset(dist,INF,sizeof(dist));

    dist[x0] = 0;
    q.push(x0);

    while(!q.empty()){
        int nod = q.front();
        q.pop();
        v[nod] ++;
        if(v[nod] > n + 1){
            printf("-1");
            return;
        }
        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;
                q.push(vecini[nod][i].first);
            }
        }
    }
    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 = 0; i < m; ++i){
        scanf("%d%d%d",&x,&y,&c);
        vecini[x].push_back(make_pair(y,c));
    }
    bf(1);
    return 0;
}