#include <bits/stdc++.h>

using namespace std;

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

vector < pair< int, int> > h[50005];
int n, p, d[50005], m;

void Dijkstra (int nod)
{
    set <pair <int, int > > S;
    S.insert({1 , nod});
    for (int i = 1; i <= n; i++)
        d[i] = 2e9;
    d[nod] = 0;
    while (!S.empty())
    {
        int n = S.begin() -> second;
        int dist = S.begin() -> first;
        S.erase(S.begin());
        for (auto i : h[n])
        {
            if (d[n] + i.first < d[i.second])
            {
                S.erase({d[i.second],i.second});
                d[i.second] = d[n] + i.first;
                S.insert({d[i.second], i.second});
            }
        }
    }
    for (int i = 2; i <= n; i++)
        if (d[i] != 2e9)
            fout << d[i] << " ";
        else fout << "0 ";
}

int main()
{
    fin >> n >> m;
    int i , j ,c;
    for (int pas = 1; pas <= m; pas++)
    {
        fin >> i >> j >> c;
        h[i].push_back({c, j});
        ///h[j].push_back({c, i});
    }
    Dijkstra(1);
    return 0;
}