#include <fstream>
#include <vector>
#include <queue>
using namespace std;
ifstream cin ("dijkstra.in");
ofstream cout ("dijkstra.out");
const int mcjolle = 2e9;
struct ura{
    int cost, nod;
    bool operator < (const ura &other) const{
        if (cost != other.cost)
            return cost < other.cost;
        else
            return nod < other.nod;
    }
};
vector <ura> lista[50005];
int dist[50005];
int viz[50005];
priority_queue <ura> q;
int main()
{
    int n, m, x, y, c, i;
    cin >> n >> m;
    for (i = 1; i <= m; i++)
    {
        cin >> x >> y >> c;
        lista[x].push_back({c, y});
    }
    for (i = 2; i <= n; i++)
        dist[i] = mcjolle;
    q.push({0, 1});
    while (q.size())
    {
        int nodd = q.top().nod;
        q.pop();
        if (viz[nodd] == 0)
            for (i = 0; i < lista[nodd].size(); i++)
                if (dist[nodd] + lista[nodd][i].cost < dist[lista[nodd][i].nod])
                {
                    dist[lista[nodd][i].nod] = dist[nodd] + lista[nodd][i].cost;
                    q.push({dist[lista[nodd][i].nod], lista[nodd][i].nod});
                }
        viz[nodd] = 1;
    }
    for (i = 2; i <= n; i++)
    {
        if (dist[i] == mcjolle)
            dist[i] = 0;
        cout << dist[i] << " ";
    }
    return 0;
}