#include <iostream>
#include <cstdio>
#include <vector>
#define NMAX 50005
#define INF 0x3f3f3f
#include <queue>

using namespace std;

int n, m, viz[NMAX], distanta[NMAX];
vector <pair <int, int> > g[NMAX];
vector <pair <int, int> >::iterator it;
priority_queue <pair <int, int> > q;

void read()
{
    scanf("%d%d", &n, &m);
    int x, y, c;
    for(int i=1; i<=m; ++i)
    {
        scanf("%d%d%d", &x, &y, &c);
        g[x].push_back(make_pair(y, c));
    }
    for(int i=2; i<=n; ++i)
        distanta[i]=INF;
}

void dijkstra()
{
    q.push(make_pair(0, 1));
    int nod, cost;
    while(!q.empty())
    {
        nod=q.top().second;
        if(viz[nod]==1)
            continue;
        viz[nod]=1;
        q.pop();
        for(it=g[nod].begin(); it!=g[nod].end(); ++it)
        {
            if(viz[it->first]==0 && distanta[it->first]>distanta[nod]+it->second)
            {
                distanta[it->first]=distanta[nod]+it->second;
                q.push(make_pair(-1*distanta[it->first], it->first));
            }

        }
    }
}

void afisare()
{
    for(int i=2; i<=n; ++i)
        if(distanta[i]!=INF)
            printf("%d ", distanta[i]);
        else
            printf("0 ");
}

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