#include <fstream>
#include <vector>
#include <set>
#define INF 2e9;
using namespace std;
ifstream cin ("dijkstra.in");
ofstream cout ("dijkstra.out");
vector < pair <int,int> > lista[50010]; /// first - nod, second - cost
int dist[50010],n,viz[50010];
void dijkstra(int sursa)
{
    int i,nod,vecin,cost;
    for (i=1; i<=n; i++)
        dist[i]=INF;
    set <pair <int,int> > s; ///first - distanta, second - nod
    dist[sursa]=0;
    s.insert({0,sursa});
    while (s.size()>0)
    {
        nod=s.begin()->second;
        s.erase(s.begin());
        if (viz[nod]==0)
        {
            viz[nod]=1;
            for (i=0; i<lista[nod].size(); i++)
            {
                vecin=lista[nod][i].first;
                cost=lista[nod][i].second;
                if (dist[nod]+cost<dist[vecin])
                {
                    dist[vecin]=dist[nod]+cost;
                    s.insert({dist[vecin],vecin});
                }
            }
        }
    }
}
int main()
{
    int m,i,x,y,c;
    cin>>n>>m;
    for (i=1; i<=m; i++)
    {
        cin>>x>>y>>c;
        lista[x].push_back({y,c});
    }
    dijkstra(1);
    for (i=2; i<=n; i++)
    {
        if (dist[i]==2e9)
            cout<<0<<" ";
        else
            cout<<dist[i]<<" ";
    }
    return 0;
}