#include <bits/stdc++.h>
#define NMAX 50005
#define oo (1 << 30)
using namespace std;

ifstream f("dijkstra.in");
ofstream g("dijkstra.out");

int d[NMAX], x, y, n, m, i, vecin, cost, k, c;
bool viz[NMAX];

vector <pair <int, int> > v[NMAX];

struct elem
{
    bool operator()(int x, int y)
    {
        return d[x] > d[y];
    }
};

priority_queue <int, vector <int>, elem> Q;

int main()
{
    f >> n >> m;
    for(i = 1; i <= m; ++ i)
    {
        f >> x >> y >> c;
        v[x].push_back(make_pair(y, c));
    }

    for(i = 1; i <= n; ++ i)
        d[i] = oo;

    d[1] = 0;
    viz[1] = 1;
    Q.push(1);

    while(!Q.empty())
    {
        k = Q.top();
        Q.pop();
        viz[k] = 0;
        for(i = 0; i < v[k].size(); ++ i)
        {
            vecin = v[k][i].first;
            cost = v[k][i].second;
            if(d[vecin] > d[k] + cost)
            {
                d[vecin] = d[k] + cost;
                if(viz[vecin] == 0)
                {
                    viz[vecin] = 1;
                    Q.push(vecin);
                }
            }
        }
    }

    for(i = 2; i <= n; ++ i)
        if(d[i] == oo)
            g << "0 ";
        else
            g << d[i] << " ";
    return 0;
}