#include <fstream>
#include <vector>
#include <queue>
#include <algorithm>
#define NMAX 50005
#define inf 2000000000

using namespace std;

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

int i, n, m, d[NMAX], x, y, z;
bool visited[NMAX];
vector < pair < int, int > > v[NMAX];

struct comp
{
    bool operator () (pair < int, int > a, pair < int, int > b)
    {
        return a.second > b.second;
    }
};

priority_queue < pair < int, int >, vector < pair < int, int > >, comp > pq;

void dijkstra()
{
    pq.push({1, 0});
    d[1] = 0;

    while (!pq.empty())
    {
        int curr = pq.top().first;
        pq.pop();

        for (auto & it : v[curr])
            if (d[it.first] > d[curr] + it.second)
        {
            d[it.first] = d[curr] + it.second;
            pq.push({it.first, d[it.first]});
        }
    }
}

int main()
{
    f >> n >> m;

    for (i = 1; i <= m; ++ i)
    {
        f >> x >> y >> z;

        v[x].push_back({y, z});
        v[y].push_back({x, z});
    }

    for (i = 2; i <= n; ++ i)
        d[i] = inf;

    dijkstra();

    for (i = 2; i <= n; ++ i)
        if (d[i] == inf)
            g << 0 << " " ;
        else
            g << d[i] << " " ;
    return 0;
}