#include <fstream>
#include<vector>
#include<queue>
#define inf 999999
#define pp pair<int,int>
using namespace std;
ifstream fin("dijkstra.in");
ofstream fout("dijkstra.out");
vector<pair<int,int> > a[50005];
int n,m,d[50001];
priority_queue<int,vector<int> > q;
void cit(){
    int i,j,h,w;
    fin>>n>>m;
    for(h=1;h<=m;h++){
        fin>>i>>j>>w;
        a[i].push_back(pp(j,w));
    }
    fin.close();
}
void dijkstra(){
    int i,k;
    d[1]=0;
    for(i=2;i<=n;i++)
        d[i]=inf;
    q.push(1);
    while(!q.empty()){
        k=q.top();
        q.pop();
        for(i=0;i<a[k].size();i++)
            if(d[a[k][i].first]>d[k]+a[k][i].second){
                d[a[k][i].first]=d[k]+a[k][i].second;
                q.push(a[k][i].first);
            }
    }
}
int main(){
    cit();
    dijkstra();
    for(int i=2;i<=n;i++)
        if(d[i]!=inf)
            fout<<d[i]<<" ";
    fout.close();
    return 0;
}