#include <fstream>
#include <queue>
#include <vector>
using namespace std;

ifstream cin("dijkstra.in");
ofstream cout("dijkstra.out");

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

    vector<vector<pair<int,int>>> adj(n+1);

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

    const int INF = 1e9;
    vector<int> dist(n+1, INF);

    priority_queue<
        pair<int,int>,
        vector<pair<int,int>>,
        greater<pair<int,int>>> Q;

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

    while(!Q.empty())
    {
        int d = Q.top().first;
        int nod = Q.top().second;
        Q.pop();

        if(d != dist[nod]) continue;

        for(auto p : adj[nod])
        {
            int v = p.first;
            int cost = p.second;

            if(dist[nod] + cost < dist[v])
            {
                dist[v] = dist[nod] + cost;
                Q.push({dist[v], v}); // 🔥 ASTA ERA BUG-UL
            }
        }
    }

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

    return 0;
}