#include<fstream>
#include<set>
#include<vector>
#include<cstring>
using namespace std;
ifstream fin("dijkstra.in");
ofstream fout("dijkstra.out");
const int NMAX=50005,inf=250000*200;
vector<pair<int,int>>v[NMAX];
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;
    set<pair<int,int>>s;
    s.insert(make_pair(1,0));
    while(!s.empty()){
        int nod=s.begin()->first;
        s.erase(s.begin());
        int j;
        for(j=0;j<v[nod].size();++j){
            int cost=v[nod][j].second;
            int vecin=v[nod][j].first;
            if(drum[nod]+cost<drum[vecin]){
                if(drum[vecin]!=inf)
                    if(s.find(make_pair(vecin,drum[vecin]))!=s.end())
                        s.erase(s.find(make_pair(vecin,drum[vecin])));
                drum[vecin]=drum[nod]+cost;
                s.insert(make_pair(vecin,drum[vecin]));
            }
        }
    }
}
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();
}