#include <bits/stdc++.h>
#define ll long long
#define lf long double
#define INF 0x3f3f3f3f
#define cin fin
#define cout fout

using namespace std;

ifstream fin("dijkstra.in");
ofstream fout("dijkstra.out");

int n,m,x,y,c,d[50001],viz[50001];
vector<pair<int,int>> v[50005];
priority_queue<pair<int,int>> p;

int main()
{
    ios_base::sync_with_stdio(false);
    cin>>n>>m;
    for (int i=1;i<=m;i++)
    {
        cin>>x>>y>>c;
        v[x].push_back({y,c});
    }
    for (int i=2;i<=n;i++)
        d[i]=INF;
    p.push({0,1});
    while (!p.empty())
    {
        auto t=p.top();
        p.pop();
        if (!viz[t.second])
        {
            viz[t.second]=1;
            for (auto vec:v[t.second])
            {
                d[vec.first]=min(d[vec.first], d[t.second]+vec.second);
                p.push({-d[vec.first], vec.first});
            }
        }
    }
    for (int i=2;i<=n;i++)
        if (d[i]!=INF)
        cout<<d[i]<<" ";
    else cout<<0<<" ";
    return 0;
}

//Long long output!!!
//Check constraints!!!