#include <fstream>
#include <bits/stdc++.h>

using namespace std;
ifstream fin("dijkstra.in");
ofstream fout("dijkstra.out");
int n, m, x, y, cost, i, dist[50005];
vector <pair<int, int>> v[50005];
int main()
{
    ios_base::sync_with_stdio(false);
    fin>>n>>m;
    for(i=1; i<=m; i++)
    {
        fin>>x>>y>>cost;
        v[x].push_back(make_pair(y, cost));
    }
    for(i=2; i<=n; i++)
        dist[i]=50005;
    set<pair<int, int>> q;
    q.insert(make_pair(1, 0));
    while(!q.empty())
    {
        int nod=q.begin()->first;
        int cost=q.begin()->second;
        q.erase(q.begin());
        for(vector<pair<int, int>>::iterator it=v[nod].begin(); it!=v[nod].end(); it++)
        {
            int y=it->first;
            int costit=it->second;
            if(dist[y]>dist[nod]+costit)
            {
                if(dist[y]!=50005)
                    q.erase(q.find(make_pair(y, dist[y])));
                dist[y]=dist[nod]+costit;
                q.insert(make_pair(y, dist[y]));
            }
        }
    }
    for(i=2; i<=n; i++)
        if(dist[i]==50005)
           fout<<0<<" ";
    else
        fout<<dist[i]<<" ";

    return 0;
}