#include <bits/stdc++.h>
#define inf 10000000
using namespace std;
ifstream fin("dijkstra.in");
ofstream fout("dijkstra.out");
int viz[50005],drum[50005],n,m;
vector <pair<int,int> >L[50005];
priority_queue <pair<int,int> >q;
void Citire()
{
    int x,y,c;
    fin>>n>>m;
    for(int i=1;i<=m;i++)
    {
        fin>>x>>y>>c;
        L[x].push_back(make_pair(y,c));
    }
    for(int i=1;i<=n;i++)
        drum[i]=inf;
}
void Rez()
{
    int el;
    q.push({0,1});
    drum[1]=0;
    while(!q.empty())
    {
        el=q.top().second;
        q.pop();
        if(!viz[el])
        {
            viz[el]=1;

            for(int i=0;i<L[el].size();i++)
                if((drum[L[el][i].first]>(drum[el]+L[el][i].second)))
                    drum[L[el][i].first]=drum[el]+L[el][i].second,
                    q.push({-drum[L[el][i].first], L[el][i].first});
        }
    }
    for(int i=2;i<=n;i++)
        if(drum[i]==inf)
            fout<<"0 ";
        else fout<<drum[i]<<" ";
    fout<<"\n";
}
int main()
{
    Citire();
    Rez();
    return 0;
}