#include <stdio.h>
#include<set>
#include<utility>
#include<vector>
using namespace std;
#define nmax 50005
#define inf 1<<30
struct element{long n,c;};
long n, m, i, dmin[nmax], a, b, c;
set <pair <long, long> > h;
pair <long, long> x;
vector <element> ma[nmax];
vector <element>::iterator it;
element el;

void citire()
{
    scanf("%ld %ld",&n,&m);
    for (i=1;i<=m;i++)
    {
        scanf("%ld %ld %ld",&a,&b,&c);
        el.n=b; el.c=c;
        ma[a].push_back(el);
    }
}

void rezolvare()
{
    for (i=2;i<=n;i++)
        dmin[i]=inf;
    h.insert(make_pair(0,1));
    while (h.size())
    {
        x=*h.begin();    h.erase(h.begin());
        for (it=ma[x.second].begin();it!=ma[x.second].end();it++)
            if (dmin[(*it).n]>dmin[x.second]+(*it).c)
            {
                dmin[(*it).n]=dmin[x.second]+(*it).c;
                h.insert(make_pair(dmin[(*it).n],(*it).n));
            }
    }
}


int main()
{
    freopen("dijkstra.in","r",stdin);
    freopen("dijkstra.out","w",stdout);
    citire();
    rezolvare();
    for (i=2;i<=n;i++)
        printf("%ld ",dmin[i]);
    return 0;
}