//nu ii frumos sa te uiti pe sursele altora:))...hotule....nu o sti face singur?:))
#include <iostream>
#include <fstream>
#include <queue>
#include <vector>
using namespace std;
# define MAX 50010
# define INF 1<<30
ifstream fin("dijkstra.in");
ofstream fout("dijkstra.out");

vector < pair < int , int > > G[MAX];
priority_queue < pair < int , int > > heap;

int viz[MAX], n, m, i, a, b, c, cost, nod, best[MAX];

int main()
{
    fin>>n;
    fin>>m;
    for(i=1;i<=m;i++)
    {
        fin>>a>>b>>c;
        G[a].push_back( make_pair( b , c ) );
    }
    for(i=1;i<=n;i++)
    {
        best[i]=INF;
    }
    best[1]=0;
    heap.push(make_pair(0 ,1));
    while(!heap.empty())
    {

        nod=heap.top().second;
        cost=best[nod];
        heap.pop();
        if(viz[nod])
            continue;
        viz[nod]=1;
        for(i=0;i<G[nod].size();i++)
        {
            if(cost+G[nod][i].second<best[G[nod][i].first])
            {
                best[G[nod][i].first]=cost+G[nod][i].second;
                heap.push(make_pair(-best[G[nod][i].first],G[nod][i].first));
            }
        }
    }
    for(i=2;i<=n;i++)
        {
            if(best[i]!=INF)
                fout<<best[i]<<" ";
            else
                fout<<0<<" ";

        }



}