#include <bits/stdc++.h>

using namespace std;

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

priority_queue<pair<int,int> >q;

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

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

void solve()
{
    q.push({0,1});
    pair<int,int>sus;
    int nod, val;
    while (!q.empty())
    {
        sus=q.top();
        val=sus.first;
        nod=sus.second;
        q.pop();
        if (val==dp[nod])
        {
            for (auto &v:graph[nod])
            {
                if (dp[v.first]>dp[nod]+v.second)
                {
                    dp[v.first]=dp[nod]+v.second;
                    q.push({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;
}