#include <fstream>
#include <vector>
#include <limits>
#include <set>

using namespace std;

const int INF = numeric_limits<int>::max();

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

int n, m;
vector<pair<int, int>> ad[50001];

int main()
{
    fin >> n >> m;
    for (int i = 0; i < m; i++)
    {
        int a, b, c;
        fin >> a >> b >> c;
        ad[a].push_back({ b, c });
        ad[b].push_back({ a, c });
    }

    vector<int> dist(n + 1, INF);
    multiset<pair<int,int>> pq;

    dist[1] = 0;
    pq.insert({ 0, 1 });

    while (!pq.empty())
    {
        pair<int, int> min1 = *pq.begin();
        pq.erase(pq.begin());
        int u = min1.second;

        for (int i = 0; i < ad[u].size(); i++)
        {
            int v = ad[u][i].first;
            int g = ad[u][i].second;

            if (dist[u] + g < dist[v])
            {
                dist[v] = dist[u] + g;
                pq.insert({ dist[v], v });
            }
        }
    }

    for (int i = 2; i <= n; i++)
    {
        if (dist[i] == INF)
            fout << "0 ";
        else
            fout << dist[i] << " ";
    }
    return 0;
}