#include <bits/stdc++.h>
using namespace std;

const int MAX = 50005, inf = 0x3F3F3F3F;
vector<pair<int,int>> graph[MAX];
vector<int> dist;
bitset<MAX> visited;

void dijkstra(int start)
{
    priority_queue<pair<int,int>, vector<pair<int,int>>, greater<pair<int,int>>> pq;
    pq.push({0, start});
    dist[start] = 0;

    while (!pq.empty())
    {
        auto node = pq.top();
        pq.pop();

        if (!visited[node.second])
        {
            visited[node.second] = 1;
            for (auto next : graph[node.second])
            {
                if (dist[next.first] > dist[node.second] + next.second)
                {
                    dist[next.first] = dist[node.second] + next.second;
                    pq.push({dist[next.first], next.first});
                }
            }
        }
    }
}

int main()
{
    ifstream cin("dijkstra.in");
    ofstream cout("dijkstra.out");
    int n, m;
    cin >> n >> m;
    dist.assign(n+1, inf);

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

    dijkstra(1);
    for (int i = 2; i <= n; ++i)
        if (dist[i] == inf)
            cout << "0 ";
        else
            cout << dist[i] << " ";

    return 0;
}