#include <bits/stdc++.h>
const int NMAX=50005, INF = 1e9;
using namespace std;

typedef pair<int, int> link;
vector<link> links[NMAX];
int mcost[NMAX];

inline void dijkstra(int p){
    queue<int> q;
    int t;

    q.push(p);
    mcost[p]=0;
    while(!q.empty()) {
        t=q.front();
        q.pop();
        for(auto &i: links[t]) {
            if(mcost[i.first] > i.second + mcost[t]) {
                mcost[i.first] = i.second + mcost[t];
                q.push(i.first);
            }
        }
    }
}

int main(void){
    ///freopen("dat.in","r",stdin);
    freopen("dijkstra.in","r",stdin);
    freopen("dijkstra.out","w",stdout);
    int n,m,u,v,c;
    scanf("%d%d",&n,&m);
    for(int i=0; i<m; ++i){
        scanf("%d%d%d",&u,&v,&c);
        links[u].push_back(make_pair(v,c));
    }

    for(int i=0; i<NMAX; ++i)
        mcost[i]=INF;

    dijkstra(1);
    for(int i=2; i<=n; ++i)
        printf("%d ",(mcost[i]!=INF)?mcost[i]:0);
    return 0;
}