#include <fstream>
#include <vector>
#include <set>
using namespace std;
ifstream f("dijkstra.in");
ofstream g("dijkstra.out");
#define inf 2000000000
vector < pair<int,int> > A[50001];
vector < pair<int,int> > :: iterator it;
set < pair<int, int> > L;
int N, D[50001];
int main()
{
    int m, i, x, y, c, ok, min, k;
    f >> N >> m;
    for(i = 1; i <= m; i++){
        f >> x >> y >> c;
        A[x].push_back(make_pair(y,c));
    }
    for( i = 1; i <= N; i++ ){
        D[i] = inf;
    }
    D[1] = 0;
    L.insert(make_pair(0,1));
    while(!L.empty()){
        min = L.begin()->first;
        k = L.begin()->second;
        L.erase(L.begin());
        /*for(i = 1; i <= N; i++)
            if(D[i] < min && V[i] == 0){
                    min = D[i];
                    k = i;
            }*/
        if(min != inf){
            for( it = A[k].begin(); it < A[k].end(); it++ )
                if( D[it->first] > D[k] + it->second ){
                    if(D[it->first] != inf){
                        L.erase(L.find(make_pair(D[it->first],it->first)));
                    }
                    D[it->first] = D[k] + it->second;
                    L.insert(make_pair(D[it->first],it->first));
                }
        }
    }
    for(i = 2; i <= N; i++)
        if(D[i] == inf)
            g << "0 ";
        else
            g << D[i] << " ";
    return 0;
}