#include <iostream>
#include <vector>
#include <fstream>
#include <queue>
#include <list>
using namespace std;

struct node{int b,c;};


int main(){
    ifstream ifs("dijkstra.in");
    ofstream ofs("dijkstra.out");
    int N,M;
    ifs>>N>>M;

    vector<list<node> > g(N);

    for(int i=0;i<M;i++){
        int a;
        node t;
        ifs>>a>>t.b>>t.c;t.b--;a--;
        g[a].push_back(t);
    }

    queue<int> q; q.push(0);
    vector<int> m(N,-1);m[0]=0;

    while(!q.empty()){
        int a=q.front();
        q.pop();
        for(list<node>::iterator it=g[a].begin();it!=g[a].end();it++){
            if(-1==m[it->b]){
                m[it->b]=m[a]+it->c;
                q.push(it->b);
            }
            else if(m[a]+it->c<m[it->b])
                m[it->b]=m[a]+it->c;
        }
    }

    for(int i=1;i<m.size();i++)
        if(-1==m[i])cout<<0<<" ";
        else cout<<m[i]<<" ";
}