#include <fstream>
#include <vector>
#include <set>
#define DIM 50010
#define INF DIM*1000

using namespace std;

ifstream fin  ("dijkstra.in");
ofstream fout ("dijkstra.out");

vector<pair<int, int> > l[DIM];
set   <pair<int, int> > s;

int n, m, x, y, c, k;
int v[DIM], d[DIM];

int main() {
    fin>>n>>m;
    for(int i=1;i<=m;i++) {
        fin>>x>>y>>c;
        l[x].push_back( {y, c} );
    }

    for(int i=1; i<=n; i++)
        d[i] = INF;
    d[1] = 0;

    s.insert( {0,1} );

    while(!s.empty()) {
        k = s.begin()->second;
        s.erase( s.begin() );

        for (int i=0; i<l[k].size(); i++)
            if (d[ l[k][i].first ] > d[k] + l[k][i].second) {

                s.erase (  {d[ l[k][i].first ], l[k][i].first} );
                d[l[k][i].first] = d[k] + l[k][i].second;
                s.insert(  {d[ l[k][i].first ], l[k][i].first} );
            }
    }

    for(int i=2; i<=n; i++)
        if(d[i] == INF)
            fout<<"0 ";
        else
            fout<<d[i]<<" ";
    return 0;
}