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

/**
*/
ifstream fin("dijkstra.in");
ofstream fout("dijkstra.out");
///                 cost  nod
priority_queue< pair<int, int> > q;
int n, m, viz[50002], d[500002];
///          nod  cost
vector< pair<int, int> > G[50002];

void Citire()
{
    int i, j, c;
    fin >> n >> m;
    for (int p = 1; p <= m; p++)
    {
        fin >> i >> j >> c;
        G[i].push_back({j, c});
    }
}
/// O(n log n)
void Dijkstra(int s)
{
    int i, k, minim;
    for (i = 1; i <= n; i++)
        d[i] = oo;
    d[s] = 0;
    q.push({0, s});
    while(!q.empty())
    {
        auto e = q.top();
        q.pop();
        k = e.second;
        if (d[k] == oo) return;
        if (viz[k] == 0)
        {
            viz[k] = 1;
            for (auto e : G[k])
            {
                i = e.first;
                if (d[i] > d[k] + e.second)
                {
                    d[i] = d[k] + e.second;
                    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(1);
    Afis();
    return 0;
}