#include <bits/stdc++.h>

using namespace std;

const int NMAX = 5e4 + 5, INF = 1e9 + 7;
int n, m, dist[NMAX];
vector <pair<int, int>> v[NMAX];

int32_t main()
{
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);

    freopen("dijkstra.in", "r", stdin);
    freopen("dijkstra.out", "w", stdout);

    cin >> n >> m;
    int a, b, c;
    for(int i = 1; i <= m; i++)
    {
        cin >> a >> b >> c;
        v[a].push_back({b, c});
        v[b].push_back({a, c});
    }

    for(int i = 1; i <= n; i++)
        dist[i] = INF;

    priority_queue <pair<int, int>, vector<pair<int, int>>, greater<pair<int, int>>> q;
    q.push({0, 1});
    while (!q.empty()) 
    {
        int cost = q.top().first, node = q.top().second;
        cerr << cost << " "<< node << "\n";
        q.pop();

        if(cost > dist[node])
            continue;

        dist[node] = cost;
        for (auto u : v[node]) 
        {
            if (dist[u.first] == INF || dist[u.first] > cost + u.second) 
            {
                dist[u.first] = cost + u.second;
                q.push({dist[u.first], u.first});
            }
        }
    }


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