#include <fstream>
#include <vector>
#include <queue>
#define pii pair<int, int>
#define x first
#define y second
#define mk make_pair
#define MAX 100005
#define INF (1<<30)
using namespace std;

int n, m, x, y, z, d[MAX];
vector<pii> l[MAX];
priority_queue<pii> q;
bool viz[MAX];

void dij(int s){
    for(int i = 1; i <= n; ++i)
        d[i] = INF;
    d[s] = 0;
    q.push(mk(d[s], s));

    while(!q.empty()){
        int x = q.top().y;
        q.pop();

        if(viz[x])
            continue;
        viz[x] = 1;

        for(int i = 0; i < l[x].size(); ++i)
            if(d[l[x][i].y] > d[x] + l[x][i].x){
                d[l[x][i].y] = d[x] + l[x][i].x;
                q.push(mk(d[l[x][i].y], l[x][i].y));
            }
    }
}

int main(){
    ifstream f("dijkstra.in");
    ofstream g("dijkstra.out");
    f >> n >> m;
    for(int i = 0; i < m; ++i){
        f >> x >> y >> z;
        l[x].push_back(mk(z, y));
    }

    dij(1);

    for(int i = 2; i <= n; ++i)
        g << (d[i] == INF ? 0 : d[i]) << " ";
    g << "\n";
    return 0;
}