#include <iostream>
#include <fstream>
#include <vector>
#include <queue>
#include <utility>
using namespace std;

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

vector<vector<pair<int, int>>> adj;
vector<int> minDistance;
vector<int> parent;
int INF = 100000000;

void Dijkstra(int sourceNode)
{
    int nr = adj.size();

    minDistance.resize(nr, INF);
    parent.resize(nr, -1);

    priority_queue<pair<int, int>, vector<pair<int, int>>, greater<pair<int, int>>> pq;
    minDistance[sourceNode] = 0;
    pq.push({0, sourceNode});

    while (!pq.empty())
    {
        int dist = pq.top().first;
        int node = pq.top().second;
        pq.pop();
        if (dist > minDistance[node])
            continue;

        for (auto edge : adj[node])
        {
            if (minDistance[node] + edge.second < minDistance[edge.first])
            {
                minDistance[edge.first] = minDistance[node] + edge.second;
                parent[edge.first] = node;
                pq.push({minDistance[edge.first], edge.first});
            }
        }
    }
}

int main()
{

    int n, m;
    f >> n >> m;
    adj.resize(n + 1);
    int a, b, c;
    for (int i = 1; i <= m; i++)
    {
        f >> a >> b >> c;
        adj[a].push_back({b, c});
    }
    int sourceNode = 1;
    Dijkstra(sourceNode);
     for (int i = 2; i <= n; i++)
        if(minDistance[i] == INF)
            minDistance[i] = 0;
    for (int i = 2; i <= n; i++)
    {
        g << minDistance[i] << " ";
    }
}