#include <bits/stdc++.h>

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

int n, m, x, y, dist, d[50005], fr[50005];
priority_queue<pair<int, int>> q;
vector<pair<int, int>> a[50005];

int main()
{
    fin >> n >> m;
    for(int i=1; i<=m; i++)
    {
        fin >> x >> y >> dist;
        a[x].push_back({-dist, y});
    }
    q.push({0,1});
    for(int i=2; i<=n; i++)
    {
        d[i]=-INT_MIN;
        q.push({INT_MIN, i});
    }
    while(!q.empty())
    {
        if(fr[q.top().second]==0)
        {
            x=q.top().second;
            for(int i=0; i<a[x].size(); i++)
                if(a[x][i].first+d[x]>d[a[x][i].second])
                {
                    q.push({a[x][i].first+d[x], a[x][i].second});
                    d[a[x][i].second]=a[x][i].first+d[x];
                }
            fr[x]++;
        }
        else
            q.pop();
    }
    for(int i=2; i<=n; i++)
    {
        if(d[i]!=INT_MIN)
            fout << -d[i] << " ";
        else
            fout << 0 << " ";
    }
    return 0;
}