#include <bits/stdc++.h>

using namespace std;

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

const int NMAX = 50000;

int n, m;
int x, y, cost;
vector < pair<int,int> > v[NMAX+1];
int in_queue[NMAX+1];
int nr_entrances[NMAX+1];
int dist_min[NMAX+1];

int main()
{
    fin >> n >> m;
    for(int i=1; i<=m; i++)
    {
        fin >> x >> y >> cost;
        v[x].push_back(make_pair(cost, y));
    }
    for(int i=2; i<=n; i++)
        dist_min[i] = INT_MAX;
    queue < pair<int,int> > q;
    dist_min[1] = 0;
    in_queue[1] = 1;
    nr_entrances[1] = 1;
    q.push(make_pair(0,1));
    while(!q.empty())
    {
        auto f = q.front();
        q.pop();
        int nod = f.second;
        int dist_cur = f.first;
        in_queue[f.second] = 0;
        for(auto a : v[nod])
            if(dist_min[a.second] > dist_min[nod] + a.first)
            {
                dist_min[a.second] = dist_min[nod] + a.first;
                q.push(make_pair(dist_min[a.second], a.second));
            }
    }
    for(int i=2; i<=n; i++)
        fout << dist_min[i] << ' ';
    return 0;
}