#include <bits/stdc++.h>
#define inf 1000000000
using namespace std;

ifstream fin("dijkstra.in");
ofstream fout("dijkstra.out");

int drum[50005],viz[50005],n,m;

priority_queue <pair<int,int> >q;
vector <pair<int,int> >L[50005];


void Citire()
{
    int x,y,c;

    fin>>n>>m;

    for(int i=1;i<=m;i++)
    {
        fin>>x>>y>>c;
        L[x].push_back({y,c});
    }

    for(int i=1;i<=n;i++)
        drum[i]=inf;
}
void Dijkstra()
{
    int f,p,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++)
            {
                f=L[el][i].first;
                p=L[el][i].second;
                if(drum[f]>drum[el]+p)
                {
                    drum[f]=drum[el]+p;
                    q.push({-drum[f],f});
                }
            }
        }
    }

    for(int i=2;i<=n;i++)
        if(drum[i]==inf)
            fout<<"0 ";
        else fout<<drum[i]<<" ";
    fout<<"\n";
}
int main()
{
    Citire();
    Dijkstra();
    return 0;
}