#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 n,m,x,y,d;
int maxx = 2000000009;
int dist[50005];

int main()
{
    f >> n >> m;
    for (int i=1;i<=m;i++) {
        f >> x >> y >> d;
        v[x].push_back(make_pair(y,d));
    }
    for (int i=1;i<=n;i++) {
        dist[i]=maxx;
    }
    dist[1]=0;
    s.insert(make_pair(dist[1],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]==maxx) {
            g << 0 << " ";
        }
        else {
            g << dist[i]<< " ";
        }
    }
    return 0;
}