#include <bits/stdc++.h>

using namespace std;

ifstream f("dijkstra.in");
ofstream g("dijkstra.out");

const int nmax = 5e4 + 1;

priority_queue < pair <int, int> > q;

vector < pair <int, int> > robert[nmax];

int n, m, x, y, cost, d[nmax], nod;

bool ap[nmax];

int Dijkstra(int x)
{
    q.push({0, 1});
    ap[1] = 1;
    for(int i = 2; i <= n; ++i)
        d[i] = 2e9;
    while(!q.empty())
    {
        nod = q.top().second;
        ap[nod] = 0;
        q.pop();

        for(int i = 0; i < robert[nod].size(); ++i)
        {
            if(d[robert[nod][i].second] > d[nod] + robert[nod][i].first)
            {
                d[robert[nod][i].second] = d[nod] + robert[nod][i].first;
                if(!ap[robert[nod][i].second])
                {
                    ap[robert[nod][i].second] = 1;
                    q.push({-d[robert[nod][i].second], robert[nod][i].second});
                }
            }
        }
    }
}

int main()
{
    f >> n >> m;

    for(int i = 1; i <= m; ++i)
    {
        f >> x >> y >> cost;
        robert[x].push_back({cost, y});
    }

    Dijkstra(1);

    for(int i = 2; i <= n; ++i)
        if(d[i] == 2e9)
            g<<0<<' ';
        else
            g<<d[i]<<' ';

    return 0;
}