#include <fstream>
#include <queue>
#include <vector>
#include <algorithm>
using namespace std;
ifstream f("dijkstra.in");
ofstream g("dijkstra.out");

int N, M, x, y, z, D[50005];
struct asd{ int y, cost;}aux;
struct cmp
{
    bool operator()(const int &A, const int &B)const
    {
        return (D[A]>D[B]);
    }
};
vector < asd > G[50005];
priority_queue < int, vector <int>, cmp> Q;

void dijkstra(int sursa)
{
    for (int i=1; i<=N; ++i)
        D[i]=(1<<30);
    D[sursa]=0; Q.push(sursa);

    while (Q.size())
    {
        int nod=Q.top(); Q.pop();
        vector <asd>::iterator it=G[nod].begin();
        for (; it!=G[nod].end(); ++it)
            if (D[nod]+it->cost < D[it->y])
            {
                D[it->y]=D[nod]+it->cost;
                Q.push(it->y);
            }
    }
}

int main()
{
    f>>N>>M;
    for (int i=1; i<=M; ++i)
        f>>x>>aux.y>>aux.cost, G[x].push_back(aux);

    dijkstra(1);
    for (int i=2; i<=N; ++i)
        if (D[i]!=(1<<30)) g<<D[i]<<' ';
            else g<<0<<' ';
    return 0;
}