#include <bits/stdc++.h>

using namespace std;

ifstream f("dijkstra.in");
ofstream g("dijkstra.out");

typedef pair <int, int> edge;

vector <edge> vecini[50001];
priority_queue <edge, vector <edge>, greater<edge>> pq;
int n, m, dist[50001];

void Djikstra (int start)
{
    for (int i=1;i<=n;i++)
        dist[i] = INT_MAX;

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

    while (!pq.empty())
    {
        int d = pq.top().first;
        int i = pq.top().second;
        pq.pop();

        if (d > dist[i]) continue;

        for (auto e : vecini[i])
        {
            int w = e.first;
            int j = e.second;

            if (dist[j] > dist[i] + w)
            {
                dist[j] = dist[i] + w;
                pq.push({dist[j], j});
            }
        }
    }
}

int main()
{
    f>>n>>m;
    for (int i=1; i<=m; i++)
    {
        int x, y, w;
        f>>x>>y>>w;
        vecini[x].push_back({w, y});
    }
    Djikstra(1);

    for (int i=2; i<=n; i++)
        if (dist[i] != INT_MAX)
            g<<dist[i]<<' ';
        else
            g<<0<<' ';
}