#include <iostream>
#include <cstdio>
#include <vector>
#include <queue>
#include <algorithm>
using namespace std;
 
#define N_MAX  50000
#define INFINIT 9999999
 
vector<pair<int,int> >graf[N_MAX+1];
int n,m;
 
void citire()
{
    scanf("%d %d ",&n,&m);
    for(int i=1;i<=m;i++)
    {
        int nod1,nod2,cost;
        scanf("%d %d %d ",&nod1,&nod2,&cost);
        graf[nod1].push_back(make_pair(nod2,cost));
    }
}
int a[N_MAX+1];
void dijkstra()
{
    priority_queue< pair<int,int> , vector < pair<int,int> > , greater< pair<int,int> > > q;
    vector<int> dist(n+1, INFINIT);
 
    q.push(make_pair(0, 1));
 
    fill(dist.begin(),dist.end(),INFINIT);
 
    dist[1]=0;
 
    while(!q.empty())
    {
        int nod = q.top().second;
        q.pop();
        int len=graf[nod].size();
        for (int i = 0; i < len; i++)
        {
            int vecin = graf[nod][i].first,cost = graf[nod][i].second;
 
            if (dist[vecin] > dist[nod] + cost)
            {
                dist[vecin] = dist[nod] + cost;
                q.push(make_pair(dist[vecin], vecin));
            }
        }
    }
    for (int i = 2; i <= n; i++)
        printf("%d ",dist[i]!=INFINIT ? dist[i] : 0);
}
int main()
{
    freopen("dijkstra.in","r",stdin);
    freopen("dijkstra.out","w",stdout);
    citire();
    dijkstra();
    return 0;
}