#include <fstream>
#include <vector>
#include <set>
#define INF 2000000000
using namespace std;
vector <pair<int, int> >L[50010];
set <pair<int, int> >s;
int n,m,i,x,y,c,k,d[50010];
int main() {
    ifstream fin("dijkstra.in");
    ofstream fout("dijkstra.out");
    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;
    s.insert(make_pair(0,1));
    while (!s.empty()){
        k=s.begin()->second;
        s.erase(s.begin());
        for (i=0;i<L[k].size();i++){
            if (d[L[k][i].first]>d[k]+L[k][i].second){
                s.erase ( make_pair(d[L[k][i].first],L[k][i].first));
                d[L[k][i].first]=d[k]+L[k][i].second;
                s.insert (make_pair(d[L[k][i].first],L[k][i].first));
            }
        }
    }
    for (i=2;i<=n;i++){
        if (d[i]==INF)
            fout<<"0 ";
        else
            fout<<d[i]<<" ";
    }
    return 0;
}