#include <iostream>
#include <fstream>
#include <vector>
#include <queue>
using namespace std;
ifstream f("dijkstra.in");
ofstream g("dijkstra.out");
const int NMAX = 50001, INF = 1<<29;

struct muchie{
    int y,w;
    muchie(int yy=0,int ww=0): y(yy), w(ww){}
};

int N,M, D[NMAX];
bool inQ[NMAX];

class Comp
{
public:
    bool operator()(int a, int b)const
    {
        return D[a]>D[b];
    }
};
vector<muchie> G[NMAX];
priority_queue<int, vector<int>, Comp> Q;

void citire()
{
    int x,y,c;
    f>>N>>M;
    for(int i=1;i<=M;i++)
    {
        f>>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];
                }
            }
        }
    }
}
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)
            g<<"0 ";
        else
            g<<D[i]<<' ';
    return 0;
}