#include <iostream>
#include <fstream>
#include <cstring>
#include <queue>
#include <vector>

using namespace std;

string filename = "dijkstra";

ifstream fin(filename + ".in");
ofstream fout(filename + ".out");

const int NMAX = 50000;
const int INF = 1e9;

vector<pair<int,int>> adj[NMAX + 5];
int dist[NMAX + 5];

int main()
{
    int n,m;
    fin>>n>>m;
    for(int i=1;i<=m;i++)
    {
        int u,v,d;
        fin>>u>>v>>d;
        adj[u].push_back({v,d});
    }

    auto cmp = [](const pair<int,int>& a, const pair<int,int>& b)
    {
        return a.second > b.second;
    };

    priority_queue<pair<int, int>, vector<pair<int, int>>, decltype(cmp)> pq(cmp);

    for(int i=2;i<=n;i++)
        dist[i] = INF;

    pq.push({1,0});

    while(!pq.empty())
    {
        int nod = pq.top().first;
        int d = pq.top().second;
        pq.pop();

        if(d != dist[nod])
            continue;

        for(auto it : adj[nod])
        {
            if(dist[it.first] <= dist[nod] + it.second)
                continue;

            dist[it.first] = dist[nod] + it.second;
            pq.push({it.first,dist[it.first]});
        }
    }
    for(int i=2;i<=n;i++)
    {
        if(dist[i]==INF)
            dist[i] = 0;
        fout<<dist[i]<<' ';
    }
    return 0;
}