#include <fstream>
#include <vector>
#include <queue>
using namespace std;
#define NMAX 50000
#define INF 1000000000
typedef pair<int, int> ii;

vector<ii> a[NMAX];
int n, m, d[NMAX], start;

ifstream fin ("grafuri.in");
ofstream fout ("grafuri.out");

void Dijkstra(int node) {
    priority_queue <ii, vector<ii>, greater<ii> > pq;
    pq.push( ii(0, node) );
    int i, dist, cost, child;

    while( !pq.empty() ) {
        dist = pq.top().first;
        node = pq.top().second;
        pq.pop();

        if(d[node] < dist) {
            continue;
        }

        for(i=0; i<(int)a[node].size(); i++) {
            child = a[node][i].first;
            cost = a[node][i].second;

            if(d[child] > dist + cost) {
                d[child] = dist + cost;
                pq.push( ii(d[child], child) );
            }
        }
    }
}

int main() {
    int x, y, z, i, j;
    fin >> n >> m;
    start = 1;

    for(i=1; i<=m; i++) {
        fin >> x >> y >> z;
        a[x].push_back( ii(y, z) );
        a[y].push_back( ii(x, z) );
    }

    for(i=1; i<=n; i++) {
        d[i] = INF;
    }
    d[start] = 0;

    Dijkstra(start);

    for(i=1; i<=n; i++) {
        if(i != start) {
            if(d[i] == INF) {
                fout << 0 << " ";
            } else {
                fout << d[i] << " ";
            }
        }
    }

    return 0;
}