#include <fstream>
#include <vector>
#include <queue>
using namespace std;
ifstream fin ("dijkstra.in");
ofstream fout ("dijkstra.out");
#define NMAX 50005
#define INF 2000000000

typedef pair<int, int>ii;
vector<ii>a[NMAX];
int d[NMAX], n, m, start;

void Dij(int nod) {
    int i, child, cost, dist;
    priority_queue <ii, vector<ii>, greater<ii> >pq;
    pq.push( ii(0, nod) );

    while(!pq.empty()) {
        nod = pq.top().second;
        dist = pq.top().first;
        pq.pop();
        if(dist > d[nod])
            continue;
        for(i=0; i<(int)a[nod].size(); i++) {
            child = a[nod][i].first;
            cost = a[nod][i].second;
            if(d[child] > dist + cost) {
                d[child] = dist + cost;
                pq.push( ii(d[child], child) );
            }
        }
    }
}

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

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

    Dij(start);

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

    return 0;
}