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

ifstream fin("dijkstra.in");
ofstream fout("dijkstra.out");

///          nod cost
vector< pair<int, int> > g[50001];

 ///                cost  nod
priority_queue< pair<int, int> > q;
int n, m, d[50001], viz[50001];

void Citire()
{
    int i, x, y, cost;
    fin >> n >> m;
    for (i = 1; i <= m; i++)
    {
        fin >> x >> y >> cost;
        g[x].push_back({y, cost});
    }
}

void Dijkstra(int k)
{
    int i, cost;
    for (i = 1; i <= n; i++)
        d[i] = oo;
    d[k] = 0;
    q.push({0, k});
    while (!q.empty())
    {
        k = q.top().second;
        q.pop();
        if (viz[k] == 0)
        {
            viz[k] = 1;
            for (auto e : g[k])
            {
                i = e.first;
                cost = e.second;
                if (d[i] > d[k] + cost)
                {
                    d[i] = d[k] + cost;
                    q.push({-d[i], i});
                }
            }
        }
    }
    for (i = 2; i <= n; i++)
    {
        if (d[i] == oo) d[i] = 0;
        fout << d[i] << " ";
    }
}

int main()
{
    Citire();
    Dijkstra(1);
    return 0;
}