#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;
queue<int> coada;

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(INF);
    }
    v[1] = 1;
    d[1] = 0;
    coada.push(1);
    while(!coada.empty())
        {
            int nod=coada.front();
            coada.pop();
            v[nod]=0;

            for(int i = 1; i < a[nod].size(); i ++)
               {
                 int cost=a[nod][i];
                   if(d[nod]+cost<d[i])
                   {
                       d[i]=d[nod]+cost;
                       if(v[i]==0)
                        {
                        coada.push(i);
                        v[i]=1;
                       }
                   }
               }

        }
    for(i = 2; i <= n; i ++)
        g << (d[i] != INF ? d[i] : 0) << " ";
    return 0;
}