#include <cstdio>
#include <vector>
#include <queue>
#include <algorithm>
#define INF 99999999999999999
using namespace std;
vector < pair <int, int> > G[50005];
int n,m,i,x,y,crt,suma,tata[50005],v[50005],numar,Min;
long long d[50005],cost;
int main()
{
    freopen("dijkstra.in","r",stdin);
    freopen("dijkstra.out","w",stdout);
    scanf("%d %d",&n,&m);
    for (i=1; i<=m; i++)
    {
        scanf("%d %d %lld",&x,&y,&cost);
        G[x].push_back(make_pair(y,cost));
    }
    for (i=1; i<=n; i++) v[i]=i;
    for (i=1; i<=n; i++) d[i]=INF;
    d[1]=0;
    numar=0;
    while (numar<n)
    {
        Min=INF;
        for (i=1; i<=n; i++) if (v[i]!=0 && d[i]<Min)
            {
                Min=d[i];
                crt=i;
            }
        v[crt]=0;
        numar++;
        for (i=0; i<G[crt].size(); i++)
        {
            if (v[G[crt][i].first]!=0)
            {
                suma=d[crt]+G[crt][i].second;
                if (suma<d[G[crt][i].first])
                {
                    d[G[crt][i].first]=suma;
                    tata[G[crt][i].first]=crt;
                }
            }
        }
    }
    for (i=2; i<=n; i++) if (v[i]!=INF) printf("%d ",d[i]);
        else printf("0 ");
    return 0;
}