#include <iostream>
#include <fstream>
#include <vector>
#include <queue>
#include <climits>

using namespace std;

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

int n,m,x,y,c;

int d[50002];
bool viz[50002];

vector< pair<int, int> > v[50002];

struct compDist {

    bool operator() (int x, int y) {

        return d[x] > d[y];

    }

};

priority_queue <int, vector<int>, compDist> q;

const int INF = INT_MAX;

void dijkstra (int start) {

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

    d[start]=0;

    q.push(start);
    viz[start]=1;

    while (!q.empty()) {

        int poz = q.top();
        q.pop();
        viz[poz]=0;

        for (int i=0; i<v[poz].size(); i++) {

            int vecin = v[poz][i].first;
            int dist = v[poz][i].second;

            if (d[poz] + dist < d[vecin]) {
                d[vecin] = d[poz] + dist;

                if (viz[vecin]==0) {
                    q.push(vecin);
                    viz[vecin]=1;
                }

            }

        }

    }

}

int main()
{

    fin>>n>>m;

    for (int i=1; i<=m; i++) {

        fin>>x>>y>>c;

        v[x].push_back(make_pair(y,c));
    }

    dijkstra(1);

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

    return 0;
}