#include <iostream>
#include <fstream>
#include <vector>
#include <queue>
using namespace std;
ifstream fin("dijkstra.in");
const int nmax=50000;
const int oo=1e9;
vector <pair <int,int>> g[nmax+5];
priority_queue <pair<int,int>,vector <pair<int,int>>,greater <pair<int,int>>> q;
int d[nmax+5];
bool use[nmax+5];
int n,m;
void read(){
    fin>>n>>m;
    int x,y,c;
    for(int i=1;i<=m;++i){
        fin>>x>>y>>c;
        g[x].push_back(make_pair(y,c));
    }
}
void dijkstra(){
    for(int i=2;i<=n;++i)
        d[i]=oo;
    for(int i=1;i<=n;++i)
        q.push(make_pair(d[i],i));
    for(int i=1;i<=n;++i){
        while(q.top().first!=d[q.top().second])
            q.pop();
        int nod=q.top().second; q.pop();
        /*int Min=oo,nod;
        for(int j=1;j<=n;++j){
            if(d[j]<Min && !use[j]){
                Min=d[j];
                nod=j;
            }
        }*/
        use[nod]=true;
        for(auto i:g[nod]){
            int vecin=i.first, cost=i.second;
            if(d[nod]+cost<d[vecin]){
                d[vecin]=d[nod]+cost;
                q.push(make_pair(d[vecin],vecin));
            }
        }
    }
}
void print(){
    for(int i=2;i<=n;++i)
        if(d[i]==oo)
            d[i]=0;
    for(int i=2;i<=n;++i)
        cout<<d[i]<<" ";
}
int main()
{
    read();
    dijkstra();
    print();
    return 0;
}