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

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())
    {
        pr=*h.begin();  h.erase(h.begin());
        for (it=ma[pr.second].begin();it!=ma[pr.second].end();it++)
            if (dmin[(*it).n]>pr.first+(*it).c)
            {
                h.erase(make_pair(dmin[(*it).n],(*it).n));
                dmin[(*it).n]=pr.first+(*it).c;
                h.insert(make_pair(dmin[(*it).n],(*it).n));
            }
    }
    for (i=2;i<=n;i++)
        if (dmin[i]!=inf)
            printf("%ld ",dmin[i]);
        else
            printf("0 ");
}

int main()
{
    freopen("dijkstra.in","r",stdin);
    freopen("dijkstra.out","w",stdout);
    citire();
    rezolvare();
    return 0;
}