#include <vector>
#include <queue>
#include <fstream>
#include <iostream>

using namespace std;

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

const int LMAX = 50005;
vector <pair<int,int>> L[LMAX];
int dist[LMAX];

void dijkstra() {
    priority_queue <pair<int, int>> Q;
    Q.push({0, 1});
    dist[1] = 0;
    while (!Q.empty()) {
        int d = Q.top().first *(-1), node = Q.top().second; ///distanta pana la nodul node
        Q.pop();
        if (d > dist[node] && dist[node] != 0) {
            continue;
        }
        for (pair<int, int> vec : L[node]) {
            if (dist[node] + vec.first < dist[vec.second] || dist[vec.second] == 0) {
                dist[vec.second] = dist[node] + vec.first;
                Q.push({(-1)*(dist[node] + vec.first), vec.second});
            }
        }
    }
}


int main() {
    int n, m;
    fin>>n>>m;
    while (m--) {
        int x, y, c;
        fin>>x>>y>>c;
        L[x].push_back({c,y});
        L[y].push_back({c,x});
    }
    dijkstra();
    for (int i = 2; i <= n; i++) {
        fout<<dist[i]<<" ";
    }



    fin.close();
    fout.close();
    return 0;
}