// Dijkstra - O(MlogN)
#include <fstream>
#include <vector>
#include <queue>
#define Nmax 50009
#define oo 2000000000
using namespace std;
ifstream f("dijkstra.in");
ofstream g("dijkstra.out");

int N,M,S,F,d[Nmax],x,y,ante[Nmax];
struct muchie{int y,c;}aux;
vector < muchie > Graph[Nmax];

struct cmp
{ bool operator()(const int &x,const int &y)const
    {   return d[x]>d[y];   };
};
priority_queue < int  , vector < int > , cmp > pq;


void Dijkstra(int S)
{
    for(int i=1;i<=N;++i)d[i]=oo,ante[i]=oo;
    d[S]=ante[S]=0;
    for(pq.push(S); !pq.empty(); pq.pop() )
    {
        int node=pq.top();
		vector<muchie>::iterator it;
        for(it=Graph[node].begin() ; it!=Graph[node].end() ; ++it)
            if(d[node]+it->c < d[it->y])
            {
                d[it->y]=d[node]+it->c;
                ante[it->y]=node;
                pq.push(it->y);
            }
    }
    for (int i=1; i<=N; ++i)
        if (d[i]==oo)d[i]=0,ante[i]=0;
}


void Rebuild(int node)
{
    if(node==S){ g<<S<<' '; return; }
    Rebuild(ante[node]);
    g<<node<<' ';
}



int main()
{
    f>>N>>M; S=1;
    for(int i=1;i<=M;++i)
        f>>x>>aux.y>>aux.c , Graph[x].push_back(aux);
    Dijkstra(S);
    for (int i=2; i<=N; ++i) g<<d[i]<<' ';
    return 0;
    g<<"Drumul de la "<<S<< " la "<<F<<" are lungimea "<<d[F]<<"\n";    	g<<"si este:\n";
    Rebuild(F);
    g<<'\n';
    f.close();g.close();
    return 0;
}