#include <iostream>
#include <vector>
#include <queue>
#include <utility>
#include <fstream>

using namespace std;

ifstream f ("dijkstra.in");
ofstream g ("dijkstra.out");
int NRMAX = 1000000;

int main()
{
    int n, m, start=1;
    f >> n >> m;
    vector<pair<int, int>> G[n+1];
    for(int i = 1;i<=m;i++)
    {
        int u, v, w;
        f >> u >> v >> w;
        G[u].push_back({v, w});
    }

    priority_queue<pair<int, int>, vector<pair<int, int>>, greater<pair<int, int>>> H;
    int dist[n+1];
    for(int i = 1; i <= n; i++)
        dist[i] = NRMAX;
    dist[start] = 0;
    H.push({0, start});

    while (H.size() > 0)
    {
        //auto [d, nod] = H.top();
        auto d = H.top().first;
        auto nod = H.top().second;
        H.pop();
        if (d > dist[nod]) continue;
        for (auto h : G[nod])
        {
            auto vecin = h.first;
            auto pond = h.second;
            if (dist[vecin] > dist[nod] + pond)
            {
                dist[vecin] = dist[nod] + pond;
                H.push({dist[vecin], vecin});
            }
        }
    }

    for(int i = 2; i <= n; i++)
        if(dist[i] == NRMAX)
            g << -1 << " ";
        else
            g << dist[i] << " ";

    f.close();
    g.close();
    return 0;
}