#include<fstream>
#include<vector>
#include<queue>
#define NMAX 50009
#define INF 10000000
using namespace std;
ifstream f("dijkstra.in"); ofstream g("dijkstra.out");
int n, m, nod_a, nod_b, cost, viz[NMAX];
struct nod
{
    int v;
    int c;
    nod(){};
    nod(int a, int b)
    {
        v = a;
        c = b;
    };
};
queue<int> q;
vector<nod> x[NMAX];
inline void citire();
inline void dijkstra(int);
int main()
{
    citire();
    dijkstra(1);
    for(int i = 2; i <= n; ++i)
        if(viz[i] != INF)   g<<viz[i]<<' ';
        else
            g<<0<<' '; //Nu exista drum de la un arc la un arc j => costul este 0
    g.close();
    return 0;
}
inline void citire()
{
    f>>n>>m;
    for(int i = 1; i <= m; ++i)
    {
        f>>nod_a>>nod_b>>cost;
        x[nod_a].push_back(nod(nod_b, cost));
        if(i <= n) viz[i] = INF;
    }
    f.close();
}
inline void dijkstra(int k)
{
    q.push(k);
    viz[k] = 0;
    while(!q.empty())
    {
        k = q.front(); q.pop();
        vector<nod>::iterator it;
        for(it = x[k].begin(); it != x[k].end(); ++it)
            if((*it).c + viz[k] < viz[(*it).v])
            {
                viz[(*it).v]= (*it).c + viz[k];
                q.push((*it).v);
            }
    }
}