#include <fstream>
#include <vector>
#include <set>
#define MAX 50000
#define INF 2000000000
using namespace std;
ifstream cin ("dijkstra.in");
ofstream cout ("dijkstra.out");
vector <pair <int, int>> graph[MAX + 10];
set <pair <int, int>> s;
int dist[MAX + 10];
int main()
{
    int n, m;
    cin >> n >> m;
    for (int i = 1; i <= m; i++)
    {
        int x, y, c;
        cin >> x >> y >> c;
        graph[x].push_back({c, y});
    }
    for (int i = 1; i <= n; i++)
        dist[i] = INF;
    dist[1] = 0;
    s.insert({0, 1});
    while (!s.empty())
    {
        int node = s.begin()->second;
        s.erase(s.begin());
        for (auto it : graph[node])
        {
            int next = it.second;
            int cost = it.first;
            if (dist[next] > dist[node] + cost)
            {
                if (dist[next] != INF)
                    s.erase(s.find({dist[next], next}));
                dist[next] = dist[node] + cost;
                s.insert({dist[next], next});
            }
        }
    }
    for (int i = 2; i <= n; i++)
        if (dist[i] == INF)
            cout << 0 << ' ';
        else
            cout << dist[i] << ' ';
    return 0;
}