#include <iostream>
#include <fstream>
#include <vector>
#include <queue>
using namespace std;
ifstream f("dijkstra.in");
ofstream g("dijkstra.out");
const int NMAX = 50001, INF = 1e9;
int n, m, dis[NMAX];
vector<pair<int, int>> G[NMAX];
void citire()
{
    int x, y, c;
    f >> n >> m;
    while(m--)
    {
        f >> x >> y >> c;
        G[x].push_back({y, c});
        G[y].push_back({x, c});
    }
    for(x = 1; x <= n; x++)
        dis[x] = INF;
}
void dijkstra(int nod)
{
    int x, y, cn, dn;
    priority_queue<pair<int, int>, vector<pair<int, int>>, greater<pair<int, int>>> Q;
    dis[nod] = 0;
    Q.push({0, nod});
    while(!Q.empty())
    {
        x = Q.top().first, y = Q.top().second;
        Q.pop();
        if(x > dis[y]) continue;
        for(const auto &i : G[y])
        {
            dn = i.first, cn = i.second;
            if(dis[dn] > dis[y] + cn)
            {
                dis[dn] = dis[y] + cn;
                Q.push({dis[dn], dn});
            }
        }
    }
}
int main()
{
    citire();
    dijkstra(1);
    for(int i = 2; i <= n; i++)
        if(dis[i] == INF) g << 0 << ' ';
        else g << dis[i] << ' ';
    f.close();
    g.close();
    return 0;
}