#include<algorithm>
#include<bitset>
#include<cmath>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<ctime>
#include<deque>
#include<fstream>
#include<iomanip>
#include<iostream>
#include<map>
#include<queue>
#include<set>
#include<stack>
#include<unordered_map>
#include<unordered_set>
#include<utility>
#include<vector>

using namespace std;

#define dbg(x) (cout<<#x<<" = "<<(x)<<'\n')
#ifdef HOME
const string inputFile = "input.txt";
const string outputFile = "output.txt";
#else
const string problemName = "dijkstra";
const string inputFile = problemName + ".in";
const string outputFile = problemName + ".out";
#endif // HOME

typedef long long int lld;
typedef pair<int, int> PII;
typedef pair<int, lld> PIL;
typedef pair<lld, int> PLI;
typedef pair<lld, lld> PLL;

const int INF = (1LL << 31) - 1;
const lld LINF = (1LL << 62) - 1;
const int dx[] = {1, 0, -1, 0, 1, -1, 1, -1};
const int dy[] = {0, 1, 0, -1, 1, -1, -1, 1};
const int MOD = (int)(1e9) + 7;

const int NMAX = 100000 + 5;
const int MMAX = 100000 + 5;
const int KMAX = 100000 + 5;
const int PMAX = 100000 + 5;
const int LMAX = 100000 + 5;
const int VMAX = 100000 + 5;

int N, M;
vector<PII> V[NMAX];
int dist[NMAX];
priority_queue<PII, vector<PII>, greater<PII> > PQ;

void dijkstra(int x) {
    int i, d;

    for(i = 1; i <= N; i++)
        dist[i] = INF;

    dist[x] = 0;
    PQ.push(make_pair(dist[x], x));

    while(!PQ.empty()) {
        x = PQ.top().second;
        d = PQ.top().first;

        PQ.pop();

        if(d > dist[x])
            continue;

        for(auto y : V[x])
            if(d + y.second < dist[y.first]) {
                dist[y.first] = d + y.second;
                PQ.push(make_pair(dist[y.first], y.first));
            }
    }
}

int main() {
    int i, x, y, z;

#ifndef ONLINE_JUDGE
    freopen(inputFile.c_str(), "r", stdin);
    freopen(outputFile.c_str(), "w", stdout);
#endif

    scanf("%d%d", &N, &M);

    while(M--) {
        scanf("%d%d%d", &x, &y, &z);
        V[x].push_back(make_pair(y, z));
    }

    dijkstra(1);

    for(i = 2; i <= N; i++)
        printf("%d ", dist[i] == INF ? 0 : dist[i]);

    return 0;
}