#include <fstream>
#include <vector>
#include <limits>
#include <queue>

using namespace std;

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

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

int n, m;
vector<vector<pair<int, int>>> ad;

int main()
{
    fin >> n >> m;
    ad.resize(n + 1);

    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 });  // Undirected graph
    }

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

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

    while (!pq.empty())
    {
        pair<int, int> min1 = pq.top();
        pq.pop();
        int u = min1.second;

        for (size_t 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.push({ dist[v], v });
            }
        }
    }

    for (int i = 2; i <= n; i++)
    {
        fout << (dist[i] == INF ? 0 : dist[i]) << " ";
    }
    fout << "\n";

    return 0;
}