#include<iostream>
#include<cstdio>
#include<set>
#include<vector>
using namespace std;
set<pair<int,int> > s;
///first=distanta; second=nodul
vector<pair<int,int> >v[50001];
///first=vecini; second=costul
int n,m,dist[50001];
void citire()
{
    int x,y,z;
    cin>>x>>y>>z;
    v[x].push_back(make_pair(y,z));
}
void dijkstra(int k)
{
    int d, nod;
    for(int i=0; i<v[1].size(); i++) s.insert(make_pair(v[1][i].second,v[1][i].first));
    while(s.empty()==false)
    {
        d=(*s.begin()).first;
        nod=(*s.begin()).second;
        dist[nod]=d;
        s.erase(s.begin());
        for(int i=0; i<v[nod].size(); i++)
        {
            s.insert(make_pair(d+v[nod][i].second,v[nod][i].first));
        }
    }

}
int main()
{
    freopen("dijkstra.in","r",stdin);
    freopen("dijkstra.out","w",stdout);
    int i;
    cin>>n>>m;
    for(i=1; i<=m; i++) citire();
    dijkstra(1);
    for(i=2; i<=n; i++) cout<<dist[i]<<" ";
    return 0;
}