# include <fstream>
# include <vector>
# include <set>
# define DIM 50010
# define INF 1000000000
# define f first
# define s second
using namespace std;
ifstream fin("dijkstra.in");
ofstream fout("dijkstra.out");
set<pair<int,int> > myset;
vector<pair<int,int> > Lista[DIM];
int d[DIM],n,m,i,x,y,cost;
int main () {
    fin>>n>>m;
    for(i=1;i<=m;i++){
        fin>>x>>y>>cost;
        Lista[x].push_back(make_pair(y,cost));
    }
    myset.insert(make_pair(0,1));
    for(i=2;i<=n;i++){
        myset.insert(make_pair(INF,i));
        d[i]=INF;
    }
    for(i=1;i<=n;i++){
        int nc=myset.begin()->s;
        myset.erase(myset.begin());
        for(int j=0;j<Lista[nc].size();j++){
            int nv=Lista[nc][j].f;
            int cost=Lista[nc][j].s;
            if(d[nv]>d[nc]+cost){
                myset.erase(myset.find(make_pair(d[nv],nv)));
                d[nv]=d[nc]+cost;
                myset.insert(make_pair(d[nv],nv));
            }
        }
    }
    for(i=2;i<=n;i++)
        if(d[i]==INF)
            fout<<"0 ";
        else
            fout<<d[i]<<" ";
    return 0;
}