#include <bits/stdc++.h>
using namespace std;
ifstream in ("dijkstra.in");
ofstream out ("dijkstra.out");
vector <pair <int, int> > v[50001];
int dist[50001];
int n, m;
void dij (int start)
{
    dist[start] = 0;
    set <pair <int, int> > seti;
    seti.insert({0, start});
    while (!seti.empty())
    {
        int nod = (*seti.begin()).second;
        seti.erase(seti.begin());
        for (auto vecin:v[nod])
        {
            if (dist[vecin.first] > dist[nod] + vecin.second)
            {
                if (dist[vecin.first] != (1<<30))
                    seti.erase(seti.find({dist[vecin.first], vecin.first}));
                seti.insert({dist[nod] + vecin.second, vecin.first});
                dist[vecin.first] = dist[nod] + vecin.second;
            }
        }
    }
}
void solve()
{
    in >> n >> m;
    for (int i = 1;i<=m;++i)
    {
        int a, b, c;
        in >> a >> b >> c;
        v[a].push_back({b,c});
    }
    for (int i = 1;i<=n;++i)
        dist[i] = 1<<30;
    dij(1);
    for (int i = 2;i<=n;++i)
        if (dist[i] == (1<<30))
            out << 0 << ' ';
        else
            out << dist[i] << ' ';
}
main ()
{
    // ios_base::sync_with_stdio(false);
    // cin.tie(NULL);
    int t = 1;
    //cin >> t;
    while (t--)
        solve();
    return 0;
}