#include<fstream>
#include<queue>
#define NMAX 20000
#define INF 100000000
using namespace std;
ifstream f("bellmanford.in"); ofstream g("bellmanford.out");
int n, m, x[NMAX][NMAX], nod_a, nod_b, cost, viz[NMAX];
queue<int> q;
inline void citire();
inline void BF(int);
int main()
{
    citire();
    BF(1);
    g.close();
    return 0;
}
inline void citire()
{
    f>>n>>m;
    for(int i = 1; i <= n; ++i)
    {
        for(int j = 1; j <= m; ++j) x[i][j]= INF;
        viz[i] = INF;
    }
    for(int i = 1; i <= m; ++i)
    {
        f>>nod_a>>nod_b>>cost;
        x[nod_a][nod_b] = cost;
    }
}
inline void BF(int k)
{
    q.push(k);
    viz[k] = 0;
    while(!q.empty())
    {
        k = q.front(); q.pop();
        for(int i = 1; i <= m; ++i)
            if(x[k][i] != INF && x[k][i] + viz[k] < viz[i])
            {
                viz[i]= x[k][i] + viz[k];
                q.push(i);
            }
    }
    for(int i = 2; i <= n; ++i)
        g<<viz[i]<<" ";
}