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

const int inf = (1<<30)+1000000000;
int N, M, D[50005], x;
struct muchie{ int y, c; }aux;
struct cmp
{
    bool operator()(const int &a, const int &b)const
    {
        if (D[a]>D[b]) return 1;
        return 0;
    }
};

vector < muchie > G[50002];
priority_queue < int, vector < int >, cmp> Q;

void dijkstra(int sursa)
{
    memset(D, inf, sizeof(D));
    D[sursa]=0; Q.push(sursa);

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

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

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