#include <fstream>
#include <vector>
#include <queue>
#define pii pair<int,int>
#define dim 50002
#define inf 0x3f3f3f3f
using namespace std;

ifstream cin("dijkstra.in");
ofstream cout("dijkstra.out");

int n,m,v[dim],d[dim];
vector<pii>V[dim];

struct cmp{
    bool operator()(int a,int b){
        return d[a]>d[b];
    }
};

priority_queue<int,vector<int>,cmp>Q;

void dij(){
    for(int i=2;i<=n;++i) d[i]=inf;
    v[1]=1;
    Q.push(1);
    
    while(!Q.empty()){
        int nod=Q.top();
        v[nod]=0;
        Q.pop();
        
        for(auto nbr:V[nod]){
            int cost=nbr.second;
            int vec=nbr.first;
            if(d[vec]>d[nod]+cost){
                d[vec]=d[nod]+cost;
                if(!v[vec]){
                    Q.push(vec);
                    v[vec]=1;
                }
            }
        }
    }
}

int main()
{
    cin>>n>>m;
    for(int i=1;i<=m;++i){
        int a,b,c;
        cin>>a>>b>>c;
        V[a].push_back({b,c});
    }
    
    dij();
    for(int i=2;i<=n;++i)
        if(d[i]==inf) cout<<0<<" ";
        else cout<<d[i]<<" ";
    return 0;
}