#include <iostream>
#include <fstream>
#include <vector>
#include <queue>
using namespace std;
ifstream fin("dijkstra.in");
ofstream gout("dijkstra.out");
const int INF=1<<30;
struct muchie
{
    int y,w;
    muchie(int yy=0,int ww=0)
    {
        y=yy;
        w=ww;
    }
};
int N,M,D[50001];
bool inQ[50001];
class Comp
{
public:
    bool operator()(int a,int b)const
    {
        return D[a]>D[b];
    };
};
vector <muchie>g[50001];
priority_queue<int,vector<int>,Comp>q;
void citire()
{
    int x,y,c;
    fin>>N>>M;
    for(int i=1; i<=M; ++i)
    {
        fin>>x>>y>>c;
        g[x].push_back(muchie(y,c));
    }
}
void dijkstra(int nod)
{
    int crt,cost;
    D[nod]=0;
    inQ[nod]=1;
    q.push(nod);
    while(!q.empty())
    {
        crt=q.top();
        q.pop();
        inQ[crt]=0;
        for(const muchie&mm:g[crt])
        {
            cost=D[crt]+mm.w;
            if(D[mm.y]>cost)
            {
                D[mm.y]=cost;
                if(!inQ[mm.y])
                {
                    q.push(mm.y);
                    inQ[mm.y]=1;
                }
            }
        }
    }
}
int main()
{
    int i;
    citire();
    for(i=1; i<=N; ++i)D[i]=INF;
    dijkstra(1);
    for(i=2; i<=N; ++i)if(D[i]==INF)gout<<"0 ";
        else gout<<D[i]<<' ';
    return 0;
}