#include <fstream>
#include<vector>
#include<queue>
#include<climits>
using namespace std;
ifstream fin("dijkstra.in");
ofstream fout("dijkstra.out");
vector<pair<int,int>>v[50001];
priority_queue<pair<int,int>,vector<pair<int,int>>,greater<pair<int,int>>>pq;
int costuri[50001],n,m,x,y,cost;
bool viz[50001];
void dijkstra()
{
    costuri[1]=1;
    pq.push({1,1});

    while(!pq.empty())
    {
        int nod=pq.top().first;
        int cost=pq.top().second;
        pq.pop();
        if(viz[nod]==1)
            continue;
        viz[nod]=1;
        for(int i=0;i<v[nod].size();i++)
        {
            int nodx=v[nod][i].first;
            int costx=v[nod][i].second;
            if(costuri[nodx]>costx+cost)
            {
                costuri[nodx]=costx+cost;
                pq.push({nodx,costuri[nodx]});

            }
        }
    }
}
int main()
{
    fin>>n>>m;
    for(int i=1;i<=m;i++)
    {
        fin>>x>>y>>cost;
        v[x].push_back({y,cost});
    }
    for(int i=1;i<=n;i++)
        costuri[i]=INT_MAX;
    dijkstra();
    for(int i=2;i<=n;i++)
    {
        if(costuri[i]==INT_MAX)
            fout<<0<<" ";
        else
            fout<<costuri[i]-1<<" ";
    }

    return 0;
}