#include <fstream>
#include <vector>
#include <queue>
#define NMAX 50005
#define MMAX 250005

using namespace std;

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

struct ok{
    int vec, cost;
};

struct ok2{
    int nod, dist;
    bool operator < (ok2 a) const
    {
        return dist < a.dist;
    }
};

const int INF = 2e9 + 5;

vector < ok > adj[NMAX];
priority_queue < ok2 > q;

int distmin[NMAX];

int main()
{
    int n, m, i, j, a, b, c;
    in >> n >> m;
    for (i = 1; i <= m; ++i)
    {
        in >> a >> b >> c;
        adj[a].push_back({b, c});
    }

    for (i = 1; i <= n; ++i)
        distmin[i] = INF;

    q.push({1, 0});
    distmin[1] = 0;
    while(!q.empty())
    {
        int x = q.top().nod;
        int d = q.top().dist;
        q.pop();

        //out << x << " " << d << '\n';
        for (i = 0; i < adj[x].size(); ++i)
        {
            if (d + adj[x][i].cost < distmin[adj[x][i].vec])
            {
                q.push({adj[x][i].vec, d + adj[x][i].cost});
                distmin[adj[x][i].vec] = d + adj[x][i].cost;
            }
        }
    }

    for (i = 2; i <= n; ++i)
    {
        if (distmin[i] == INF)
            out << 0 << " ";
        else
            out << distmin[i] << " ";
    }
    return 0;
}