#include<fstream>
#include<vector>
#include<deque>
#include<climits>
using namespace std;
ifstream fin("dijkstra.in");
ofstream fout("dijkstra.out");
const int NMAX=50005,inf=INT_MAX;
vector<pair<int,int>>v[NMAX];
deque<int>d;
int drum[NMAX];
int n,m;
void citire(){
    int i,x,y,c;
    fin>>n>>m;
    for(i=1;i<=m;++i){
        fin>>x>>y>>c;
        v[x].push_back(make_pair(y,c));
    }
}
void dijkstra(){
    int i;
    for(i=2;i<=n;++i)
        drum[i]=inf;
    d.push_back(1);
    while(!d.empty()){
        int nod=d.front();
        d.pop_front();
        int j;
        for(j=0;j<v[nod].size();++j){
            int cost=v[nod][j].second;
            if(drum[nod]+cost<drum[v[nod][j].first]){
                drum[v[nod][j].first]=drum[nod]+cost;
                d.push_back(v[nod][j].first);
            }
        }
    }
}
void afisare(){
    int i;
    for(i=2;i<=n;++i){
        if(drum[i]==inf)
            drum[i]=0;
        fout<<drum[i]<<' ';
    }

}
int main(){
    citire();
    dijkstra();
    afisare();
}