#include <bits/stdc++.h>

using namespace std;

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

vector<pair<int,int>>graph[50005];
set<pair<int,int> >q;

int n, m, from, to, cost, dp[50005];


void solve()
{
    q.insert({0,1});
    int nod, val;
    while (!q.empty())
    {
        auto sus=q.begin();
        val=sus->first;
        nod=sus->second;
        q.erase(q.begin());
        for (auto &v:graph[nod])
        {
            if (dp[v.first]>dp[nod]+v.second)
            {
                q.erase({dp[v.first],v.first});
                dp[v.first]=dp[nod]+v.second;
                q.insert({dp[v.first],v.first});
            }
        }
    }
    for (int i=2; i<=n; ++i)
    {
        if (dp[i]==0x3f3f3f3f)
            g << 0 <<' ';
        else
            g << dp[i] <<' ';
    }
}

int main()
{
    f >> n >> m;
    for (int i=1; i<=m; ++i)
    {
        f >> from >> to >> cost;
        graph[from].push_back({to,cost});
    }
    for (int i=2; i<=n; ++i)
        dp[i]=0x3f3f3f3f;
    solve();
    return 0;
}