#include <iostream>
#include <vector>
#include <cstring>
#include <queue>
#include <fstream>
#define dmax 10005
#define INF 10000009

using namespace std;

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

int dist[dmax];

struct Compare{
    bool operator() (int e1, int e2) {
        return dist[e1] > dist[e2];
    }
};

int n, m, x, y, w;
priority_queue<int, vector<int>, Compare> pq;
int pVerif, newV;
vector<pair<int, int> > graf[dmax];

bool viz[dmax];

void Dijkstra() {
    pq.push(1);
    viz[1] = true;
    dist[1] = 0;
    while (!pq.empty()) {
        pVerif = pq.top();
        pq.pop();
        viz[pVerif] = false;
        for (int i = 0; i < graf[pVerif].size(); i++) {
            newV = graf[pVerif][i].first;
            if (dist[pVerif] + graf[pVerif][i].second < dist[newV]) {
                dist[newV] = dist[pVerif] + graf[pVerif][i].second;
                if (!viz[newV]) {
                    pq.push(newV);
                    viz[newV] = true;
                }
            }
        }
    }
}

int main()
{
    int i, j;
    fin >> n >> m;
    for (i = 1; i <= m; i++) {
        fin >> x >> y >> w;
        graf[x].push_back({y, w});
        graf[y].push_back({x, w});
    }
    for (i = 1; i <= n; i++) dist[i] = INF;
    Dijkstra();
    for (i = 2; i <= n; i++) {
        if (dist[i] != INF)
            fout << dist[i] << ' ';
        else fout << "0 ";
    }
    return 0;
}