#include <iostream>
#include <fstream>
#include <vector>
#include <queue>
using namespace std;
vector <pair<int,int> > graf[50005];
priority_queue <pair<int,int> > heap;
int dist[50005];
int viz[50005];
void dijkstra(int S,int N)
{
    int i,j,lim,vecin,dmin,index,cost;
    pair<int,int> pereche;
    while(heap.empty()==0)
    {
        pereche=heap.top();
        heap.pop();
        index=pereche.second;
        dmin=-pereche.first;
        if(dist[index]!=dmin)
            continue;
        //viz[index]=1;
        lim=graf[index].size();
        for(j=0;j<lim;j++)
        {
            vecin=graf[index][j].second;
            cost=graf[index][j].first;
            if(dist[vecin]>dist[index]+cost)
            {
                dist[vecin]=dist[index]+cost;
                heap.push(make_pair(-dist[vecin],vecin));
            }
        }
    }
}
int main()
{
    ifstream in("dijkstra.in");
    ofstream out("dijkstra.out");
    int N,M,i,x,y,c;
    in>>N>>M;
    for(i=2;i<=N;i++)
        dist[i]=1000000001;
    for(i=1;i<=M;i++)
    {
        in>>x>>y>>c;
        graf[x].push_back(make_pair(c,y));
    }
    heap.push(make_pair(0,1));
    for(i=2;i<=N;i++)
    {
        heap.push(make_pair(-dist[i],i));
    }
    dijkstra(1,N);
    for(i=2;i<=N;i++)
        if(dist[i]==1000000001)
        dist[i]=0;
    for(i=2;i<=N;i++)
        out<<dist[i]<<" ";
    return 0;
}