#include <bits/stdc++.h>
#define pb push_back
#define INF INT_MAX
#define NMAX 50005

using namespace std;

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

int n,p,x,y,c,dist[NMAX],m;
vector<pair<int,int>> adj[NMAX];
priority_queue< pair<int,int> , vector<pair<int,int>> , greater<pair<int,int>>> pq;
int main()
{
    ios_base::sync_with_stdio(0);
    fin >> n >> m;
    for(int i=1; i <= m; i++)
    {
        fin >> x >> y >> c;
        adj[x].pb({y,c});
    }
    dist[1] = 0;
    for(int i=1; i <= n; i++)
        if(i != 1)
            dist[i] = INF;
    pq.push({0,1});
    while(!pq.empty())
    {
        int nod = pq.top().second;
        int costnod = pq.top().first;
        pq.pop();
        for(int i=0; i < adj[nod].size(); i++)
        {
            if(dist[nod] + adj[nod][i].second < dist[adj[nod][i].first])
                dist[adj[nod][i].first] = dist[nod] + adj[nod][i].second , pq.push({dist[adj[nod][i].first],adj[nod][i].first});
        }
    }
    for(int i=2; i <= n; i++)
        if(dist[i] == INF)
            fout << 0 << ' ';
        else
            fout << dist[i] << ' ';
    return 0;
}