#include <cstdio>
#include <vector>
#include <queue>
#include <set>
#include <stack>
#include <algorithm>
#include <cmath>
#include <cstring>
#include <iomanip>

#define NMax 50005
#define INF 0x3f3f3f3f
using namespace std;
int n,m,x,y,c;
int dist[NMax];
vector<pair<int,int> > G[NMax];
set<pair<int,int> > H;

void dijkstra(int k){
    memset(dist,INF,sizeof(dist));
    dist[k] = 0;
    H.insert(make_pair(0,k));
    while(!H.empty()){
        int nod = (*H.begin()).second;
        H.erase(*H.begin());
        for(int i = 0; i < G[nod].size(); ++i){
            if(dist[G[nod][i].first] > dist[nod] + G[nod][i].second){
                dist[G[nod][i].first] = dist[nod] + G[nod][i].second;
                H.insert(make_pair(dist[G[nod][i].first],G[nod][i].first));
            }
        }
    }
    for(int i = 2; i <= n; ++i){
        printf("%d ",dist[i]);
    }
}
int main()
{
    freopen("dijkstra.in","r",stdin);
    freopen("dijkstra.out","w",stdout);
    scanf("%d%d",&n,&m);
    for(int i = 1; i <= m; ++i){
        scanf("%d%d%d",&x,&y,&c);
        G[x].push_back(make_pair(y,c));
    }
    dijkstra(1);
    return 0;
}