#include <fstream>

using namespace std;

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

#define N 50001
#define M 250001
#define INF 2147483647

int n, m;
int lst[N], vf[M], urm[M], cost[M], nvf = 0;
int h[N], poz[N], nh = 0;
int d[N];

inline void schimba(int i1, int i2)
{
    swap(h[i1], h[i2]);
    poz[h[i1]] = i1;
    poz[h[i2]] = i2;
}

inline void urca(int i)
{
    while(i >= 2 && d[h[i]] < d[h[i >> 1]])
    {
        schimba(i, (i >> 1));
        i = (i >> 1);
    }
}

inline void coboara(int i)
{
    int bun = i, fs = i << 1, fd = (i << 1) + 1;
    if(fs <= nh && d[h[fs]] < d[h[bun]])
        bun = fs;
    if(fd <= nh && d[h[fd]] < d[h[bun]])
        bun = fd;
    if(bun != i)
    {
        schimba(i, bun);
        coboara(bun);
    }
}

inline void adauga(int x)
{
    h[++nh] = x;
    poz[x] = nh;
    urca(nh);
}

inline void sterge(int i)
{
    schimba(i, nh);
    poz[h[nh]] = 0;
    nh--;
    coboara(i);
}

int main()
{
    in >> n >> m;

    while(m--)
    {
        int x, y, c;
        in >> x;
        in >> vf[++nvf];
        urm[nvf] = lst[x];
        in >> cost[nvf];
        lst[x] = nvf;
    }

    for(int i = 2; i <= n; i++)
        d[i] = INF;
    adauga(1);
    while(nh)
    {
        int x = h[1];
        sterge(1);

        for(int i = lst[x]; i; i = urm[i])
        {
            if(d[x] + cost[i] < d[vf[i]])
            {
                d[vf[i]] = d[x] + cost[i];

                if(poz[vf[i]])
                    urca(poz[vf[i]]);
                else
                    adauga(vf[i]);
            }
        }
    }

    for(int i = 2; i <= n; i++)
    {
        if(d[i] == INF)
            d[i] = 0;
        out << d[i] << ' ';
    }
    out << '\n';

    return 0;
}