#include <bits/stdc++.h>

using namespace std;

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

const int inf = (1 << 30);

const int nmax = 50005;

int n, m;

int dist[nmax];

struct Point
{
    int t, c;
};

struct Comp
{
    bool operator() (int a, int b)
    {
        return dist[a] > dist[b];
    }
};

vector < Point > l[nmax];

bitset < nmax > viz;

priority_queue < int, vector < int >, Comp > q;

void Dijkstra()
{
    q.push(1);

    while (!q.empty())
    {
        int nod = q.top();
        q.pop();
        viz[nod] = 0;

        for (Point el : l[nod])
        {
            if (dist[nod] + el.c < dist[el.t])
            {
                dist[el.t] = dist[nod] + el.c;

                if (!viz[el.t])
                {
                    q.push(el.t);
                    viz[el.t] = 1;
                }
            }
        }
    }
}

int main()
{
    fin >> n >> m;


    for (int i = 2; i <= n; i++)
        dist[i] = inf;

    for (int i = 1; i <= m; i++)
    {
        int x, y, c;

        fin >> x >> y >> c;

        l[x].push_back({y, c});
    }

    Dijkstra();


    for (int i = 2; i <= n; i++)
    {
        if (dist[i] == inf)
            dist[i] = 0;

        fout << dist[i] << ' ';
    }

    fin.close();
    fout.close();
    return 0;
}