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

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

const int inf = 1000000000;
vector<pair<int, int> > g[50005];
int n, m, dist[50005];

void citire() {
    fin >> n >> m;
    while(m--) {
        int x, y, c;
        fin >> x >> y >> c;
        g[x].push_back({y, c});
    }
}

void solve() {
    for(int i = 1; i <= n; i++) dist[i] = inf;
    priority_queue<pair<int, int> >q;
    q.push({0, 1});
    dist[1] = 0;

    while(!q.empty()) {
        int curr = q.top().second;
        int d = -q.top().first;
        q.pop();

        for(auto next: g[curr]) {
            if(dist[next.first] > dist[curr] + next.second) {
                dist[next.first] = dist[curr]+next.second;
                q.push({-dist[next.first], next.first});
            }
        }
    }
}

void afis() {
    for(int i = 2; i <= n; i++)
        fout << dist[i] << ' ';
}

int main() {
    citire();
    solve();
    afis();
}