#include <fstream>
#include <set>
#include <vector>
#define INF 50005

using namespace std;

ifstream fin ("dijkstra.in");
ofstream fout ("dijkstra.out");

set< pair<int,int> >v;
vector <pair <int,int> > l[50010];
vector <pair <int,int> > :: iterator it;
int d[50010],i,n,m,x,y,k,c;


int main () {

    fin>>n>>m;

    for (i=1;i<=m;i++) {
        fin>>x>>y>>c;
        l[x].push_back(make_pair(y,c));
    }

    for (i=1;i<=n;i++)
        d[i]=INF;
    d[1]=0;
    v.insert (make_pair (0,1));

    while (!v.empty()){
        k=v.begin()->second;
        v.erase(v.begin());
        for(it=l[k].begin();it!=l[k].end();it++){
            if(d[it->first]>d[k]+it->second) {
                d[it->first]=d[k]+it->second;
                v.insert(make_pair(d[it->first],it->first));
            }
        }
    }
    for (i=2;i<=n;i++) {
        if (d[i]!=INF)
            fout<<d[i]<<" ";
        else
            fout<<"0\n";
    }
    return 0;
}