#include <bits/stdc++.h>

using namespace std;

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

vector < pair < int , int > > v[50005];
set < pair < int , int > >s;
int dist[50005];
int n,m,c,x,y;
int oo=2000000009;

int main() {

    f>>n>>m;
    for (int i=1;i<=m;i++) {
        f>>x>>y>>c;
        v[x].push_back(make_pair(y,c));
    }
    for (int i=1;i<=n;i++) {
        dist[i]=oo;
    }
    dist[1]=0;
    s.insert(make_pair(0,1));
    while (s.empty()==0) {
        int nod=s.begin()->second;
        s.erase(s.begin());
        for (int i=0;i<v[nod].size();i++) {
            int nodtoviz = v[nod][i].first;
            int distance = v[nod][i].second;
            if (dist[nodtoviz] > dist[nod] + distance) {
                s.erase(make_pair(dist[nodtoviz],nodtoviz));
                dist[nodtoviz]=dist[nod]+distance;
                s.insert(make_pair(dist[nodtoviz],nodtoviz));
            }
        }
    }
    for (int i=2;i<=n;i++) {
        if (dist[i]!=oo) {
                g<<dist[i]<<" ";
        }
        else {
                g<<0<<" ";
        }
    }
    return 0;
}