#include <bits/stdc++.h>

using namespace std;
ifstream fin("dijkstra.in");
ofstream fout("dijkstra.out");
int n,m,x,y,cost;
vector<vector<pair<int,int> > > G;
vector<int> viz,d;
int pmin;
int main()
{
    fin>>n>>m;
    G=vector<vector<pair<int,int> > > (m+1);
    viz=d=vector<int> (n+1);
    for(int i=1;i<=m;++i){
        fin>>x>>y>>cost;
        G[x].push_back(make_pair(y,cost));
    }
    for(int i=1;i<=n;++i)
        d[i]=INT_MAX;
    int nod=1;
    for(auto t:G[nod])
        d[t.first]=t.second;
    viz[nod]=1,d[0]=INT_MAX,d[nod]=0;
    for(int k=1;k<n;++k){
        pmin=0;
        for(int i=1;i<=n;++i)
            if(!viz[i] && d[i]<d[pmin])
                pmin=i;
        if(pmin){
            viz[pmin]=1;
            for(auto t:G[pmin])
                if(!viz[t.first] && d[t.first]>d[pmin]+t.second)
                    d[t.first]=d[pmin]+t.second;
        }
    }
    for(int i=2;i<=n;++i)
        fout<<d[i]<<" ";
    return 0;
}