#include <iostream>
#include <fstream>
#include <vector>
#include <queue>
#define Nmax 1000
#define INF (1<<28)

using namespace std;

ifstream f("dijkstra.in");
ofstream g("dijkstra.out");


int a[Nmax][Nmax];
//vector <pair <int, int> > v[Nmax];
int d[Nmax], viz[Nmax];
int n, m, x, y, c;

int main()
{
    f >> n >> m;

    for (int i = 1; i <= m; i++)
    {
        f >> x >> y >> c;
        a[x][y]=c;
    }

    for (int i = 1; i <= n; i++) d[i]=INF;
    d[1]=0;
    viz[1]=1;
    int nod=1;
    for (int j = 1; j <= n; j++)
    {
        viz[nod]=1;
        for (int i = 1; i <= n; i++)
        {
            if(a[nod][i] == 0) continue;
            if(d[i] > d[nod]+a[nod][i])
            {
                d[i]=d[nod]+a[nod][i];
            }
        }
        int min1=INF;
        for (int i = 1; i <= n; i++)
            if(d[i] < min1 && viz[i] == 0)
            {
                min1=d[i];
                nod=i;
            }
    }
    for (int i = 2; i <= n; i++)
        g << d[i] << " ";
    return 0;
}