#include<fstream>
#include<vector>
using namespace std;
ifstream in("dijkstra.in");
ofstream out("dijkstra.out");

#define N 50001
#define INF ((1<<31)-1)

struct muchie
{
    int y, cost;
};

vector <muchie> a[N];

int n, m;
int d[N];
int nh;
int h[N], poz[N];

void schimba(int i1, int i2)
{
    int aux = h[i1];
    h[i1] = h[i2];
    h[i2] = aux;

    poz[h[i1]] = i1;
    poz[h[i2]] = i2;
}

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

void coboara(int i)
{
    int bun = i, fs = i*2, fd = i*2+1;
    if( fs<=nh && d[h[fs]] > d[h[bun]])
        bun = fs;
    if( fd<=nh && d[h[fd]] > d[h[bun]])
        bun = fd;

    if(i != bun)
    {
        schimba(i, bun);
        coboara(bun);
    }
}

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

void sterge(int i)
{
    schimba(i, nh);
    nh--;
    coboara(i);
    urca(i);
}

void dijkstra(int x)
{
    for(int i=1; i<=n; i++)
        d[i] = INF;
    d[x]=0;
    adauga(x);

    while(nh)
    {
        x=h[1];
        sterge(1);

        for(size_t i=0; i<a[x].size(); i++)
        {
            int y = a[x][i].y;
            int cost = a[x][i].cost;

            if(d[x] + cost < d[y])
            {
                d[y] = d[x] + cost;
                if(poz[y]==0)
                    adauga(y);
                else
                    urca(poz[y]);
            }
        }
    }
}

void citire()
{
    in >> n >> m;
    for(int i=1; i<=m; i++)
    {
        int x, y, cost;
        in >> x >> y >> cost;

        a[x].push_back((muchie) {y, cost});
    }
}

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

int main ()
{
    citire();
    dijkstra(1);
    afisare();
    return 0;
}