#include<bits/stdc++.h>
using namespace std;
 
#define MAXN 50005
#define ll long long int

const int inf=2e9;
 
vector<vector<pair<int,int>>> edge(MAXN);
vector<int> d(MAXN, inf);

vector<bool> inc(MAXN);
 
int main(){
    ifstream in("dijkstra.in");
    ofstream out("dijkstra.out");
    int n,m;
    d[0]=0;
    in>>n>>m;
    int u,v,w;
    for(int i=0;i<m;i++){
        in>>u>>v>>w;
        u--;v--;
        edge[u].push_back(make_pair(v,w));
    }
    priority_queue<pair<int,int>,vector<pair<int,int>>,greater<pair<int,int>>> q;
    q.push({d[0],0});
    while(q.size()){
        u=q.top().second;
        inc[u]=false;
        q.pop();
        for(auto x:edge[u]){
            v=x.first;
            w=x.second;
            if(d[u]+w<d[v]){
                if(!inc[v]){
                    q.push({d[u]+w,v});
                    inc[v]=true;
                }
                d[v]=d[u]+w;
            }
        }
    }
    for(int i=1;i<n;i++){
        if(d[i]!=inf)
            out<<d[i]<<" ";
        else
            out<<"0 ";
    }
    out<<"\n";
    return 0;
}