#include <fstream>
#include <vector>

using namespace std;

const int N = 5e5;
const int INF = (1 << 30);

struct arc
{
    int varf, cost;
};

int nh, n, d[N+1], h[N], poz[N+1];
vector <arc> a[N+1];

int tata(int p)
{
    return ((p - 1) / 2);
}

int fiu_s(int p)
{
    return (2 * p + 1);
}

int fiu_d(int p)
{
    return (2 * p + 2);
}

void schimba(int p1, int p2)
{
    swap(h[p1], h[p2]);
    poz[h[p1]] = p1;
    poz[h[p2]] = p2;
}

void urca(int p)
{
    while (p > 0 && d[h[p]] < d[h[tata(p)]])
    {
        schimba(p, tata(p));
        p = tata(p);
    }
}

void adauga(int pv)
{
    h[nh++] = pv;
    poz[pv] = nh - 1;
    urca(nh - 1);
}

void coboara(int p)
{
    int fs = fiu_s(p), fd = fiu_d(p), optim = p;
    if (fs < nh && d[h[fs]] < d[h[optim]])
    {
        optim = fs;
    }
    if (fd < nh && d[h[fd]] < d[h[optim]])
    {
        optim = fd;
    }
    if (optim != p)
    {
        schimba(p, optim);
        coboara(optim);
    }
}

void sterge(int ph)
{
    if (ph == nh - 1)
    {
        nh--;
        return;
    }
    schimba(ph, nh - 1);
    nh--;
    urca(ph);
    coboara(ph);
}

void dijkstra(int x0)
{
    for (int i = 1; i <= n; i++)
    {
        d[i] = INF;
        adauga(i);
    }
    d[x0] = 0;
    urca(poz[x0]);
    while (nh > 0 && d[h[0]] < INF)
    {
        int x = h[0];
        sterge(0);
        for (auto p: a[x])
        {
            int y = p.varf, c = p.cost;
            if (d[x] + c  < d[y])
            {
                d[y] = d[x] + c;
                urca(poz[y]);
            }
        }
    }
}

int main()
{
    ifstream in("dijkstra.in");
    ofstream out("dijkstra.out");
    int m;
    in >> n >> m;
    for (int i = 0; i < m; i++)
    {
        int x, y, c;
        in >> x >> y >> c;
        a[x].push_back((arc){y, c});
    }
    dijkstra(1);
    for (int i = 2; i <= n; i++)
    {
        if (d[i] == INF)///din 1 nu se poate ajunge in i
        {
            d[i] = 0;
        }
        out << d[i] << " ";
    }
    in.close();
    out.close();
    return 0;
}