#include <stdio.h>
#include <set>
#include <vector>
using namespace std;
#define nmax 50005
#define inf 1<<30
struct element{int n, c;};
int n, m, a, b, c, i, sol[nmax];
vector <element> ma[nmax];
vector <element> :: iterator it;
pair<int,int> x;
set< pair<int,int> > v;
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++)
        sol[i]=inf;
    v.insert(make_pair(0,1));
    while (v.size())
    {
        x=*v.begin();       v.erase(v.begin());
        for (it=ma[x.second].begin();it!=ma[x.second].end();it++)
            if (sol[(*it).n]>sol[x.second]+(*it).c)
            {
                v.insert(make_pair(sol[x.second]+(*it).c, (*it).n));
                sol[(*it).n]=sol[x.second]+(*it).c;
            }
    }
}

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