/// drum minim in graf

#include <iostream>
#include <queue>
#include <vector>
#include <stdio.h>

#define cost first
#define nod second
#define nMax 50003
#define INF 0x3f3f3f3f

using namespace std;

priority_queue< pair<int, int>, vector<pair<int, int> >, greater<pair<int,int> > > Q;

vector < pair<int, int> > G[nMax];

int d[nMax], n, m;

void Dijkstra()
{
    ///initializare
    d[1] = 0;
    for(int i=2;i<=n;++i)
        d[i] = INF;

    Q.push(make_pair(0, 1));
    ///initializare

    while(!Q.empty())
    {
        int x = Q.top().nod;
        Q.pop();
        for(vector< pair<int,int> > :: iterator it = G[x].begin(); it!=G[x].end(); ++it)
        {
            if(d[it->nod] > d[x] + it->cost)
            {
                d[it->nod] = d[x] + it->cost;
                Q.push(make_pair(d[it->nod], it->nod));
            }
        }
    }
}


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

int main()
{

    freopen("dijkstra.in", "r", stdin);
    freopen("dijkstra.out", "w", stdout);

    int a,b,c;
    scanf("%d %d\n", &n, &m);
    //cin>>n>>m;
    for(int i=1;i<=m;++i)
    {
        scanf("%d %d %d\n", &a, &b, &c);
        //cin>>a>>b>>c;
        G[a].push_back(make_pair(c, b));
    }

    Dijkstra();

    afisare();

    return 0;
}