#include <iostream>
#include <fstream>
#include <vector>
#include <algorithm>
#include <queue>
#include <cstring>

using namespace std;
ifstream in("dijkstra.in");
ofstream out("dijkstra.out");

#define ll long long
#define ull unsigned long long
#define ui unsigned int
#define pb push_back
#define mp make_pair
const int NMax = 1e5 + 5;
const int inf = 1e9 + 5;
const ll valMax = 1e6 + 5;
using zint = short;

int N,M;
int dist[NMax];
vector< pair<int,int> > v[NMax];

int main() {
    in>>N>>M;
    for (int i=1;i <= M;++i) {
        int x,y,c;
        in>>x>>y>>c;

        v[x].pb( {y,c} );
    }

    for (int i=2;i <= N;++i) {
        dist[i] = inf;
    }

    priority_queue< pair<int,int> > pq;
    pq.push( {0,1} );
    dist[1] = 0;
    while (pq.size()) {
        auto curr = pq.top();
        pq.pop();

        int node = curr.second, currDist = curr.first;
        if (dist[node] < currDist) {
            continue;
        }

        for (auto p : v[node]) {
            int nxt = p.first, nxtCost = p.second;
            if (dist[nxt] <= currDist + nxtCost) {
                continue;
            }

            dist[nxt] = currDist + nxtCost;
            pq.push( {dist[nxt],nxt} );
        }
    }

    for (int i=2;i <= N;++i) {
        out<<( (dist[i] == inf) ? 0 : dist[i] )<<' ';
    }

    in.close();out.close();
    return 0;
}