#include <iostream>
#include <vector>
#include <fstream>
#include <utility>
#include <queue>
#define nmax 1000000005
using namespace std;
struct compare2
{
    bool operator()(const int &l, const int &r)
    {
        return l < r;
    }
};
vector <int> graph[50005];
vector <int> graphc[50005];
priority_queue <pair<int,int>,vector<pair<int,int> >, greater<pair<int,int> > > heap;
int viz[50005];
int dist[50005];
void dijkstra(int N)
{
    int i,j,index,vecin,distanta;
    pair <int,int> pereche2;
    for(i=1;i<=N;i++)
    {
        /*cmin=1000000005;
        for(j=1;j<=N;j++)
            if(viz[j]==0 && cmin>dist[j])
            {
                index=j;
                cmin=dist[j];
            }*/
        pereche2=heap.top();
        heap.pop();
        index=pereche2.second;
        distanta=pereche2.first;
        viz[index]=1;
        int lim=graph[index].size();
        for(j=0;j<lim;j++)
        {
            vecin=graph[index][j];
            if(dist[vecin]>dist[index]+graphc[index][j])
            {
                dist[vecin]=dist[index]+graphc[index][j];
                pereche2=make_pair(dist[vecin],vecin);
                heap.push(pereche2);
            }
        }
    }
}
int main()
{
    ifstream in("dijkstra.in");
    ofstream out("dijkstra.out");
    int N,M,x,y,c,i;
    in>>N>>M;
    pair <int,int> pereche;
    for(i=0;i<M;i++)
    {
        in>>x>>y>>c;
        graph[x].push_back(y);
        graphc[x].push_back(c);
    }
    for(i=2;i<=N;i++)
    {
        dist[i]=1000000005;
        pereche=make_pair(dist[i],i);
        heap.push(pereche);
    }
    dist[1]=0;
    pereche=make_pair(0,1);
    heap.push(pereche);
    dijkstra(N);
    for(i=1;i<=N;i++)
        if(dist[i]==1000000005)
            dist[i]=0;
    for(i=2;i<=N;i++)
        out<<dist[i]<<" ";
    return 0;
}