#include <iostream>
#include <fstream>
#include <bitset>
#include <queue>
using namespace std;

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

const int NMAX = 5e4 + 5;
const int inf = (1LL<<31) - 1;

vector<pair<int, int> >v[NMAX];
bitset<NMAX> viz;

int dist[NMAX];

priority_queue<pair<int, int>, vector<pair<int, int> >, greater<pair<int, int> > > pq;

void dijkstra(int x)
{
    dist[x] = 0;
    pq.push({0, x});
    while(!pq.empty())
    {
        x = pq.top().second;
        pq.pop();

        if(viz[x])
        {
            continue;
        }
        else
        {
            viz[x] = 1;
        }

        for(pair<int, int> el : v[x])
        {
            if(dist[el.first] > dist[x] + el.second)
            {
                dist[el.first] = dist[x] + el.second;
                pq.push({dist[el.first], el.first});
            }
        }
    }
}

int main()
{
    int n, m, x, y, c, i;

    fin>>n>>m;
    for(i=1; i<=m; i++)
    {
        fin>>x>>y>>c;
        v[x].push_back({y, c});
    }

    for(i=1; i<=n; i++)
    {
        dist[i] = inf;
    }

    dijkstra(1);

    for(i=2; i<=n; i++)
    {
        if(dist[i] == inf)
        {
            fout<<0<<' ';
        }
        else
        {
            fout<<dist[i]<<' ';
        }
    }

    fin.close();
    fout.close();
    return 0;
}