#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>> q;
int n, m, dist[50001];

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

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

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


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

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

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

    Djikstra(1);

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

    return 0;

}