#include <bits/stdc++.h>
using namespace std;

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

int dist[50005];
int n,m,x,y,d;
vector < pair < int , int > > v[50005];
bool inqueue[50005];
int oo=2000000009;

struct comp {
    bool operator() (int a, int b) {
        return dist[a] > dist[b];
    }
};
priority_queue < int , vector < int > , comp > pq;

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]=oo;
    }
    dist[1]=0;
    pq.push(1);
    inqueue[1]=1;
    while (pq.empty()==0) {
        int nod = pq.top();
        pq.pop();
        inqueue[nod]=0;
        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) {
                dist[nodtoviz] = dist[nod] + distance;
                if (inqueue[nodtoviz]==0) {
                    pq.push(nodtoviz);
                    inqueue[nodtoviz]=1;
                }
            }
        }
    }
    for (int i=2;i<=n;i++) {
        if (dist[i]==oo) {
            g << 0 <<" ";
        }
        else {
            g << dist[i] << " ";
        }
    }
    return 0;
}