#include <bits/stdc++.h>
#define oo 2e9

using namespace std;

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

int n, m, vis[50002], d[50002];
set< pair<int, int> > s;
vector< pair<int, int> > G[250002];

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

void Dijkstra()
{
    int i;
    for(i = 1; i <= n; i++)
        d[i] = oo;
    d[1] = 0;
    s.insert({0, 1});
    while(!s.empty())
    {
        pair<int, int> el = *s.begin();
        int nod = el.second;
        s.erase(s.find(el));
        if(vis[nod] == 0)
        {
            vis[nod] = 1;
            for(auto w : G[nod])
            {
                int x = w.first;
                int cost = w.second;
                if(d[nod] + cost < d[x])
                {
                    d[x] = d[nod] + cost;
                    s.insert({d[x], x});
                }
            }
        }
    }
    for(i = 2; i <= n; i++)
        if(d[i] == oo)
            fout << 0 << " ";
        else fout << d[i] << " ";
}

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