#include <bits/stdc++.h>

using namespace std;
ifstream fin("dijkstra.in");
ofstream fout("dijkstra.out");
const int INF=1000000000;
const int NMAX=50001;

queue <int> q;
vector< pair<int,int> > v[NMAX];

int vcost[NMAX];
bool vcq[NMAX];
int vcnt[NMAX];
int main()
{
    int n,m,i,x,y,c,nod;
    fin>>n>>m;
    for(i=1;i<=m;i++)
    {
        fin>>x>>y>>c;
        v[x].push_back({y,c});
    }
    for(i=2;i<=n;i++)
        vcost[i]=INF;
    q.push(1);
    vcq[1]=1;
    vcost[1]=0;
    while(!q.empty()){
        nod=q.front();
        q.pop();
        vcq[nod]=0;
        int saiz=v[nod].size();
        for(i=0;i<saiz;i++)
        {
            pair<int,int> a=v[nod][i];
            if(vcost[a.first]>vcost[nod]+a.second){
                vcost[a.first]=vcost[nod]+a.second;
                vcnt[a.first]++;
                if(!vcq[a.first]){
                    vcq[a.first]=1;
                    q.push(a.first);
                }
            }
        }
    }
    for(i=2;i<=n;i++){
        if(vcost[i]==INF)
            vcost[i]=0;
        fout<<vcost[i]<<" ";
    }
    return 0;
}