#include <fstream>
#include <vector>
#include <queue>
#define inf 200000000
#define lim 50004
#define f first
#define s second
using namespace std;

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

int n, m, a, b, c, dist[lim];
bool seen[lim];
vector<pair<int, int> > G[lim];
priority_queue<pair<int, int> > pq;

int main() {
    f>>n>>m;
    for(int i=1;i<=m;i++) {
        f>>a>>b>>c;
        G[a].push_back({b,c});
    }
    for(int i=2;i<=n;i++)
        dist[i]=inf;
    pq.push({0, 1});
    while(!pq.empty()) {
        int d=pq.top().f, node=pq.top().s;
        pq.pop();
        if(seen[node])
            continue;
        seen[node]=1;
        for(auto ne:G[node]) {
            if(dist[ne.f]>dist[node]+ne.s) {
                dist[ne.f]=dist[node]+ne.s;
                pq.push({-dist[ne.f], ne.f});
            }
        }
    }

    for(int i=2;i<=n;i++) {
        if(dist[i]!=inf)
            g<<dist[i]<<' ';
        else
            g<<0<<' ';
    }

    f.close();
    g.close();
    return 0;
}