#include <bits/stdc++.h>
#define INF 500005
using namespace std;
int n, i, j, c, m, k , pmax;
vector<int > a[250005];
vector<int> v,d,t;
int main()
{
    ifstream f("dijkstra.in");
    ofstream g("dijkstra.out");

    f >> n >> m;

    for(i=0;i<=n+1;i++)
        for(j=0;j<=n+1;j++)
          a[i].push_back(INF);



    while(f >> i >> j >> c)
             a[i][j]=c;

    for(i = 0; i <= n+1; i ++)
    {
        v.push_back(0);
        d.push_back(a[1][i]);
        t.push_back(1);
    }
    v[1] = 1;
    t[1] = 0;
    d[1] = 0;
    d[0] = INF;
    for(k = 1; k < n; k ++)
        {
            pmax = 0;
            for(i = 1; i <= n; i ++)
                if(v[i] == 0 && d[i] < d[pmax])
                    pmax = i;
            if(pmax > -1)
                {
                    v[pmax] = 1;
                    for(i = 1; i <= n; i ++)
                        if(v[i] == 0 && d[i] > d[pmax] + a[pmax][i])
                          d[i] = d[pmax] + a[pmax][i], t[i] = pmax;
                }
        }
    for(i = 2; i <= n; i ++)
        g << (d[i] != INF ? d[i] : 0) << " ";
    return 0;
}