#include <iostream>
#include <vector>
#include <bitset>
#include <fstream>
#include <queue>
#include <bitset>
#define inf (1<<30)
using namespace std;
ifstream in("dijkstra.in");
ofstream out("dijkstra.out");
vector < pair < int , int > > arbore[50005];
int d[50005];
bitset < 50005 > viz;
struct comp{
    bool operator()(int x, int y){
        return (d[x]>d[y]);
    }
};
priority_queue < int, vector <int> ,comp > pq;
int n,m,x,y,c;

void dijkstra(int sursa){
    for(int i=1;i<=n;++i) d[i]=inf;
    viz[sursa]=true;
    d[sursa]=0;
    pq.push(sursa);
    while(!pq.empty()){
        int nod=pq.top();
        pq.pop();
        viz[nod]=false;
        vector < pair < int , int > > ::iterator it;
        for(it=arbore[nod].begin();it!=arbore[nod].end();++it){
            int vecin = it->first;
            int cost = it->second;
            if(d[vecin]>d[nod]+cost){
                d[vecin]=d[nod]+cost;
                if(viz[vecin]==0){
                    viz[vecin]=1;
                    pq.push(vecin);
                }
            }
        }

    }
}


int main()
{
    in>>n>>m;
    for(int i=1;i<=m;++i){
        in>>x>>y>>c;
        arbore[x].push_back(make_pair(y,c));
    }
    dijkstra(1);
    for(int  i=2;i<=n;++i){
        if(d[i]==inf) out<<0<<' ';
        else out<<d[i]<<' ';
    }
    return 0;
}