#include <iostream>
#include <fstream>
#include <vector>
#include <queue>
#include <math.h>

#define NMAX 50005
#define MMAX 250005

using namespace std;

ifstream f("dijkstra.in");
ofstream g("dijkstra.out");

vector <pair<int,int> > G[NMAX];
priority_queue <pair<int,int> > pq;
int n,m, sol[NMAX];
bool viz[NMAX];

void dijkstra(int nod)
{
    if(pq.empty()==0)//cat timp coada nu e goala
    {
        for(int i=0;i<G[nod].size();i++)
        {
            int cost=sol[nod]+G[nod][i].second; //costul unui nod=costul tatalui + costul muchiei dintre ei
            if(sol[G[nod][i].first]>cost)// daca e mai mic ca ce era inainte inregistrat, modificam in solutii si adaugam in coada
            {
                sol[G[nod][i].first]=cost;
                viz[G[nod][i].first]=1;
                pq.push(make_pair(-cost,G[nod][i].first));
            }
        }
        nod=pq.top().second;
        pq.pop(); //scot din coada de prioritati nodul de cost minim
        dijkstra(nod); //parcurg din nou graful pt nodul cu cost minim
    }
}

int main()
{
    int i,x,y,cost;
    f>>n>>m;
    for(i=1;i<=m;i++)
    {
        f>>x>>y>>cost;
        G[x].push_back(make_pair(y,cost));
    }
    for(i=1;i<=n;i++)
        if(i==1)
            sol[i]=0;
        else sol[i]=1<<30;
    pq.push(make_pair(0,1));
    dijkstra(1);
    for(i=2;i<=n;i++)
        if(viz[i]==0)
            sol[i]=0;
    for(i=2;i<=n;i++)
        g<<sol[i]<<' ';
    return 0;
}