#include <fstream>
#include <queue>
#include <vector>
using namespace std;

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

int n, m, x, y, c, dmin[50100];
vector < pair <int, int> > A[50100];
queue <int> Q;
void dijkstra()
{
    for (int i = 2; i <= n; ++i) dmin[i] = 2000000000;
    Q.push(1);
    for (; !Q.empty(); Q.pop())
    {
        int nod = Q.front();
        for (vector < pair <int, int> > :: iterator it = A[nod].begin(); it != A[nod].end(); ++it)
            if (dmin[it -> first] > dmin[nod] + it -> second)
            {
                dmin[it -> first] = dmin[nod] + it -> second;
                Q.push(it -> first);
            }
    }
}
int main()
{
    f >> n >> m;
    for (int i = 1; i <= m; ++i)
    {
        f >> x >> y >> c;
        A[x].push_back(make_pair(y, c));
    }

    dijkstra();

    for (int i = 2; i <= n; ++i, g << ' ')
        if (dmin[i] == 2000000000)
            g << "0";
        else
            g << dmin[i];

    g.close ();
    return 0;
}