#include <iostream>
#include <fstream>
#include <vector>
#include <queue>

using namespace std;
ifstream fin ("dijkstra.in");
ofstream fout ("dijkstra.out");

#define NMAX 50001
#define infinit (1<<30)-1
int n, m, a, b, c;
vector<pair<int, int>> ad[NMAX]; ///lista de adiacenta a grafului - pereche de tip: {indice, cost}
priority_queue<pair<int, int>, vector <pair<int, int>>, greater<> > q; ///pereche de tip: {cost, indice} - folosim priority queue pentru a alege eficient nodul nevizitatat cu cost minim
int d[NMAX]; /// d[x] = costul minim curent al unui drum de la nodul sursa la x (sau infinit)
int viz[NMAX]; /// viz[x] = 1 daca pentru nodul x s-a determinat costul minim

void dijkstra (int sursa)
{
    ///Initializare
    for(int i=1; i<=n; i++)
        d[i]=infinit;
    d[sursa]=0;
    q.push({0, sursa});

    while(!q.empty())
    {
        int nod=q.top().second;
        q.pop();
        if(viz[nod]==0)
        {
            viz[nod]=1;
            for(auto &vecin: ad[nod])
            {
                if(d[nod]+vecin.second<d[vecin.first]){
                    d[vecin.first]=d[nod]+vecin.second;
                    q.push({d[vecin.first], vecin.first});
                }
            }
        }
    }

}


int main()
{
    fin>>n>>m;
    for(int i=1; i<=m; i++)
    {
        fin>>a>>b>>c;
        ad[a].push_back({b, c});
    }
    dijkstra(1);
    for(int i=2; i<=n; i++)
        if(d[i]==infinit)
            fout<<"0 ";
        else
            fout<<d[i]<<" ";
    return 0;
}