#include <bits/stdc++.h>
#define oo 2000000001
using namespace std;
ifstream fin("dijkstra.in");
ofstream fout("dijkstra.out");
priority_queue< pair<int, int> > q;
int n, m, d[500002];
bool viz[50002];
vector< pair<int, int> > G[50002];

void Citire()
{
    int x, y, c;
    fin >> n >> m;
    for(int pas = 1; pas <= m; pas++)
    {
        fin >> x >> y >> c;
        G[x].push_back({y, c});
    }
}

void Dijkstra(int s)
{
    int i, k;
    for(i = 1; i <= n; i++)
        d[i] = oo;
    d[s] = 0;
    q.push({0, s});
    while(!q.empty())
    {
        auto e = q.top();
        q.pop();
        k = e.second;
        if (d[k] == oo) return;
        if(!viz[k])
        {
            viz[k] = 1;
            for(auto e : G[k])
            {
                i = e.first;
                if(d[i] > d[k] + e.second)
                {
                    d[i] = d[k] + e.second;
                    q.push({-d[i], i});
                }
            }
        }
    }
}

void Afis()
{
    for (int i = 2; i <= n; i++)
        if (d[i] == oo) fout << "0 ";
        else fout << d[i] << " ";
}


int main()
{
    Citire();
    Dijkstra(1);
    Afis();
    return 0;
}