#include <fstream>
#include <queue>
#include <vector>
#define oo 9999999
using namespace std;

ifstream fin("dijkstra.in");
ofstream fout("dijkstra.out");
int N,M,A,B,C, dist[50005],viz[50005];
struct catre {int n1; int c; bool friend operator <(catre l, catre r) {return (r.n1<l.n1 || (r.n1==l.n1 && r.c<l.c));}};
priority_queue<catre> q;
vector <catre> v[50005];
void Dijkstra(int nodd)
{
    dist[nodd]=0;
    catre x={nodd,0};
    q.push(x);
    while(!q.empty())
    {
        int nod=q.top().n1;
        int cost=q.top().c;
        q.pop();
        viz[nod]=1;
        if (dist[nod]<cost) continue;
        for(vector <catre> :: iterator it=v[nod].begin(); it!= v[nod].end();it++)
        {
            int next=(*it).n1;
            int next_cost=(*it).c;
            if(viz[next]) continue;
            if(dist[next]>next_cost+dist[nod])
            {
                dist[next]=next_cost+dist[nod];
                catre x={next,dist[next]};
                q.push(x);
            }
        }
    }
}
int main()
{
    fin>>N>>M;
    for(int i=1;i<=M;i++)
    {
        fin>>A>>B>>C;
        catre x={B,C};
        v[A].push_back(x);
    }
    for(int i=1;i<=N;i++)
        dist[i]=oo;
    Dijkstra(1);
   for(int i=2;i<=N;i++)
   {
       if(dist[i]==oo) fout<<"0"<<' ';
        else fout<<dist[i]<<' ';
   }
    return 0;
}