#include <bits/stdc++.h>
#define NM 50005
using namespace std;
ifstream fin ("dijkstra.in");
ofstream fout ("dijkstra.out");
int n, m, d[NM];
bitset<NM> viz;
vector<pair<int,int>> v[NM];
priority_queue<pair<int,int>, vector<pair<int,int>>, greater<pair<int,int>>> q;
void read();
void dijkstra()
{
    q.push({1, 1});
    for(int i=1; i<=n; i++)
        d[i] = INT_MAX/2;
    d[1] = 1;
    while(!q.empty())
    {
        int nod = q.top().second;
        q.pop();
        if(viz[nod])
            continue;
        viz[nod] = 1;
        for(auto it:v[nod])
            if(!viz[it.first] && d[nod]+it.second < d[it.first])
            {
                d[it.first] = d[nod] + it.second;
                q.push({d[it.first], it.first});
            }
    }
}
int main()
{
    read();
    dijkstra();
    for(int i=2; i<=n; i++)
        fout <<  d[i]-1 << ' ';
    return 0;
}
void read()
{
    fin >> n >> m;
    for(int i=1; i<=m; i++)
    {
        int x, y, c;
        fin >> x >> y >> c;
        v[x].push_back({y, c});
    }
}