#include <iostream>
#include <fstream>
#include <vector>
#include <queue>
#include <utility>
#define INF 500005
using namespace std;
int n, i, j, c, m, k , pmax;
vector< pair<int,int > > a[50001];
vector<int> v,d;
queue<int> coada;

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

    f >> n >> m;


    while(f >> i >> j >> c)
            a[i].push_back(make_pair(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 = 0; i < a[nod].size(); i ++)
               {
                   int j=a[nod][i].first;
                 int cost=a[nod][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;
}