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

using namespace std;
priority_queue <pair<int,int> > coada;
vector <int> graf[50005];
vector <int> grafc[50005];
int dist[50005];
int viz[50005];

void dijkstra(int x,int N)
{
    int i,j,minim,dmin,lim;
    pair <int,int> pereche;
    while(coada.empty()==0)
    {
        pereche=coada.top();
        coada.pop();
        minim=pereche.second;
        if(dist[minim]!=-pereche.first)
            continue;
        viz[minim]=1;
        lim=graf[minim].size();
        for(j=0;j<lim;j++)
        {
            if(dist[graf[minim][j]]>dist[minim]+grafc[minim][j])
            {
                dist[graf[minim][j]]=dist[minim]+grafc[minim][j];
                coada.push(make_pair(-dist[graf[minim][j]],graf[minim][j]));
            }
        }
    }
}

int main()
{
    int N,M,x,y,i,c;
    ifstream f("dijkstra.in");
    ofstream g("dijkstra.out");
    f>>N>>M;
    for(i=1;i<=M;i++)
    {
        f>>x>>y>>c;
        graf[x].push_back(y);
        grafc[x].push_back(c);
    }
    for(i=2;i<=N;i++)
        dist[i]=1000000005;
    coada.push(make_pair(0,1));
    dijkstra(1,N);
    for(i=2;i<=N;i++)
        if(dist[i]==1000000005)
        dist[i]=0;
    for(i=2;i<=N;i++)
        g<<dist[i]<<" ";
    return 0;
}