#include <iostream>
#include <fstream>
#include <vector>
#include <queue>
#include <utility>

using namespace std;
int n, i, j, c, m, k , pmax;
vector< pair<int,int > > a[50001];

queue<int> coada;

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

    f >> n >> m;

    int INF=(n-1)*20000;
    while(f >> i >> j >> c)
            a[i].push_back(make_pair(j,c));

    vector<int> v(n+1,0),d(n+1,INF);
    v[1] = 1;
    d[1] = 0;
    coada.push(1);
    while(!coada.empty())
        {
            int nod=coada.front();
            coada.pop();
          v[nod]=0;

            for(auto i:  a[nod])
               {
                   int j=i.first;
                 int cost=i.second;


                   if(d[nod]+cost<d[j])
                   {
                       d[j]=d[nod]+cost;
                       if(v[j]==0)
                        {
                        coada.push(j);
                        v[j]=1;
                       }
                   }
               }

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