#include <bits/stdc++.h>

using namespace std;
ifstream fin("dijkstra.in");
ofstream fout("dijkstra.out");
int n,m,i,x,y,cost,d[50010],nod,viz[50010];
const int inf=INT_MAX;
vector <pair<int,int>>v[50010];
priority_queue<pair<int,int>,vector<pair<int,int>>,greater<pair<int,int>>>pq;
void read()
{
    fin>>n>>m;
    for(i=1;i<=m;i++)
    {
        fin>>x>>y>>cost;
        v[x].push_back({y,cost});
    }
}
void dijkstra(int k)
{
    for(i=1;i<=n;i++)
        d[i]=inf;
    d[k]=0;
    pq.push({k,0});
    while(!pq.empty())
    {
        nod=pq.top().first;
        cost=pq.top().second;
        pq.pop();
        if(!viz[nod])
        {
            viz[nod]=1;
            for(auto x:v[nod])
            {
                if(cost+x.second<d[x.first])
                {
                    d[x.first]=cost+x.second;
                    pq.push({x.first,d[x.first]});
                }
            }
        }
    }
    for(i=2;i<=n;i++)
        if(d[i]!=inf)fout<<d[i]<<" " ;
    else fout<<"0"<<" ";
}
int main()
{
    read();
    dijkstra(1);
    return 0;
}