#include <fstream>
#include <vector>
#include <queue>
#define NMAX 50050
#define oo 1 << 30
using namespace std;



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

vector < pair<int, int> > v[NMAX];
int n, m, node_start, x, y, val, d[NMAX];
bool viz[NMAX];

// struct compara
// {
//     bool operator()(int x, int y)
//     {
//         return d[x] > d[y];
//     }
// };
	
// priority_queue<int, vector<int>, compara> q;

queue <int> q;

void dijkstra(int p) {
    for(int i = 1; i <= n; ++i)
        d[i] = oo;
    d[p] = 0;
    q.push(p);
    while(! q.empty()) {
        int node = q.front();
        q.pop();
        for(unsigned int i = 0; i < v[node].size(); ++i) {
            int vecin = v[node][i].first;
            int cost = v[node][i].second;
            if(d[vecin] > d[node] + cost) {
                d[vecin] = d[node] + cost;
                if(!viz[vecin]){
                    q.push(vecin);
                    viz[vecin] = 1;
                }
            }
        }
    }
    for(int i = 1; i <= n; ++i)
        if(i != p){
            if(oo == d[i])
                out << 0 << ' ';
            else
                out << d[i] << ' ';
        }
}

int main() {

    in >> n >> m;
    while(--m) {
        in >> x >> y >> val;
        v[x].push_back(make_pair(y, val));
    }

    dijkstra(1);

    return 0;
}