#include <bits/stdc++.h>
using namespace std;
ifstream fin("dijkstra.in");ofstream fout("dijkstra.out");
#define inf 1000000007
int n,m,viz[50010],d[50010],x,y,co;
priority_queue<pair<int,int>,vector<pair<int,int> >, std::greater<pair<int,int> > > q;
vector<pair<int,int> >a[50010];
vector<pair<int,int> >::iterator it;
pair<int,int>minn;
pair<int,int>var;
void citire()
{
    fin>>n>>m;
    while(m)
    {
        fin>>x>>y>>co;
        var.first=co;
        var.second=y;
        a[x].push_back(var);
        m-=1;
    }
    for(int i=2;i<=n;i++)
        d[i]=inf;
    for(it=a[1].begin();it<a[1].end();it++)
    {
        d[it->second]=it->first;
        var.first=it->first;
        var.second=it->second;
        q.push(var);
    }
}
void afisare()
{
    for(int i=2;i<=n;i++)
    {
        if(d[i]==inf)
            fout<<"0"<<" ";
        else
            fout<<d[i]<<" ";
    }
    fin.close();fout.close();
    exit(0);
}
int main()
{
    citire();
    viz[1]=1;
    while(!q.empty())
    {
        minn=q.top();
        q.pop();
        if(viz[minn.second]==0)
        {
            viz[minn.second]=1;
            for(it=a[minn.second].begin(); it<a[minn.second].end(); it++)
            {
                if(d[it->second]>d[minn.second]+it->first)
                {
                    d[it->second]=d[minn.second]+it->first;
                    var.first=d[it->second];
                    var.second=it->second;
                    q.push(var);
                }
            }
        }
    }
    afisare();
}