#include <fstream>
#include <vector>
#include <queue>
#include <ios>
#define INF 0x3f3f3f3f
#define dim 50003
using namespace std;
ifstream cin("dijkstra.in");
ofstream cout("dijkstra.out");

int n,m;
int d[dim],incoada[dim];
vector<pair<int,int>>V[dim];

struct inqueue{
    int x;
};

bool operator<(inqueue a,inqueue b){
    return d[a.x]<d[b.x];
}

priority_queue<inqueue>pq;

void dij(){
    for(int i=2;i<=n;++i) d[i]=INF;
    pq.push({1});
    incoada[1]=1;
    
    while(!pq.empty()){
        int nod=pq.top().x;
        pq.pop();
        incoada[nod]=0;
        
        for(int i=0;i<V[nod].size();++i){
            int vec=V[nod][i].first;
            int cost=V[nod][i].second;
            
            if(d[nod]+cost<d[vec]){
                d[vec]=d[nod]+cost;
                if(!incoada[vec]){
                    pq.push({vec});
                    incoada[vec]=1;
                }
            }
        }
            
    }
    
}

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    
    cin>>n>>m;
    for(int i=1;i<=m;++i){
        int a,b,c;
        cin>>a>>b>>c;
        V[a].push_back(make_pair(b,c));
    }
    
    dij();
    for(int i=2;i<=n;++i) 
        if(d[i]!=INF) cout<<d[i]<< " ";
        else cout<<0<<" ";
    return 0;
}