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

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

priority_queue< pair<int, int> > q;
vector< pair<int, int> > g[50003];
int n, m, viz[50003], d[50003];

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

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

void Afis()
{
    for (int i = 2; i <= n; i++)
        if (d[i] == oo) fout << "0 ";
        else fout << d[i] << " ";
}

int main()
{
    Citire();
    Dijkstra();
    Afis();
    return 0;
}
//0 1 3 4 5 7 8 9 10 11 12 13 14 15 16 17 18 21 22 24 25 26 27 29 30 34 35 36 42 44 45 47 48 51 54 56 57 58