#include <bits/stdc++.h>
using namespace std;
ifstream fin("dijkstra.in");
ofstream fout("dijkstra.out");

struct Node
{
    int x, c;
    Node(int x, int c) : x(x), c(c) {}
};

const int inf = INT_MAX;

vector<vector<Node>> adj_list;
vector<int> dist, parent;
int n, m;

void read()
{
    fin >> n >> m;

    adj_list.assign(n + 1, vector<Node>());
    dist.assign(n + 1, 0);
    parent.assign(n + 1, 0);

    for (int i = 0; i < m; i++)
    {
        int x, y, c;
        fin >> x >> y >> c;
        adj_list[x].push_back(Node(y, c));
    }
}

void dijkstra()
{
    dist[0] = dist[1] = 0;
    for (int i = 2; i <= n; i++)
    {
        dist[i] = inf;
        parent[i] = 0;
    }

    priority_queue<pair<int, int>> Q;

    Q.push({dist[1], 1});
    while (!Q.empty())
    {
        auto [d, curr] = Q.top();
        Q.pop();
        for (auto &next : adj_list[curr])
        {
            if (dist[curr] + next.c < dist[next.x])
            {
                dist[next.x] = dist[curr] + next.c;
                parent[next.x] = curr;
                Q.push({dist[next.x], next.x});
            }
        }
    }
}

int main()
{
    read();
    dijkstra();

    for (int i = 2; i <= n; i++)
        fout << dist[i] << ' ';

    return 0;
}