#include <bits/stdc++.h>

using namespace std;

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

int main()
{
    int n, m;
    fin >> n >> m;

    vector<vector<pair<int, int>>> v(n + 1);
    vector<int> dist(n + 1, INT_MAX / 2);
    dist[1] = 0;

    for (int i = 1; i <= m; i++)
    {
        int x, y, c;
        fin >> x >> y >> c;
        v[x].push_back(make_pair(y, c));
        v[y].push_back(make_pair(x, c));
    }

    priority_queue<pair<int, int>> q;

    q.push(make_pair(0, 1));

    while (!q.empty())
    {
        int nod = q.top().second;
        q.pop();

        for (auto i: v[nod])
        {
            if (dist[nod] + i.second < dist[i.first])
            {
                dist[i.first] = dist[nod] + i.second;
                q.push(make_pair(-dist[i.first], i.first));
            }
        }
    }

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