#include <iostream>
#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;

struct comp{
    bool operator() (pii a, pii b) {return a.y < b.y;}
};

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

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

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

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

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

int main(){
    freopen("dijkstra.in", "r", stdin);
    freopen("dijkstra.out", "w", stdout);
    cin >> n >> m;
    for(int i = 0; i < m; ++i){
        cin >> x >> y >> z;
        l[x].push_back(mk(y, z));
    }

    dij(1);

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