#include <cstring>
#include <iostream>
#include <fstream>
#include <vector>
#include <queue>
#include <bitset>
using namespace std;

#define inf 0x3f3f3f3f
#define MAXN 50005

typedef vector< pair<int, int> >::iterator iter;

ifstream f("dijkstra.in");
ofstream g("dijkstra.out");

int n, m;
vector< pair<int, int> > G[MAXN];
priority_queue< pair<int, int> > q;
bitset<MAXN> viz;
int dist[MAXN];

void dijkstra() {
    memset(dist, 0x3f, sizeof(dist));

    dist[1] = 0;
    q.push(make_pair(0, 1));
    while (!q.empty()) {
        int nd = q.top().second;
        int cost = q.top().first;
        q.pop();

        if (viz[nd] == true) {
            continue;
        }
        viz[nd] = true;
        dist[nd] = -cost;

        for (iter it = G[nd].begin(); it != G[nd].end(); it++) {
            if (viz[it->first] == true) {
                continue;
            }
            q.push(make_pair(cost - it->second, it->first));
        }
    }
}

int main()
{
    f >> n >> m;
    for (int i = 1; i <= m; i++) {
        int x, y, c;
        f >> x >> y >> c;
        G[x].push_back(make_pair(y, c));
        G[y].push_back(make_pair(x, c));
    }

    dijkstra();

    for (int i = 2; i <= n; i++) {
        g << dist[i] << ' ';
    }
    g << endl;

    return 0;
}