#include <iostream>
#include <fstream>
#include <vector>
#include <queue>
using namespace std;
ifstream fin("dijkstra.in");
ofstream fout("dijkstra.out");
const int nmax=50000;
const int oo=1e9;
const int cmax=50000;
queue <int>q[cmax+5];
vector <pair <int,int>> g[nmax+5];
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[cmax].push(i);
    q[0].push(1);
    for(int i=0;i<cmax;++i){
        while(!q[i].empty()){
            while(d[q[i].front()]!=i)
                q[i].pop();
            int nod=q[i].front(); q[i].pop();
            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[d[vecin]].push(vecin);
                }
            }
        }
    }
}
void print(){
    for(int i=2;i<=n;++i)
        if(d[i]==oo)
            d[i]=0;
    for(int i=2;i<=n;++i)
        fout<<d[i]<<" ";
}
int main()
{
    read();
    dijkstra();
    print();
    return 0;
}