//#include <iostream>
#include <bits/stdc++.h>
using namespace std;
ifstream in("dijkstra.in");
ofstream out("dijkstra.out");
const int Max=50005;
int n,m; int dist[Max]; bool viz[Max];
vector <pair<int,int> >v[Max];
struct compara
{
    bool operator()(int x,int y)
    {
        return dist[x]>dist[y];
    }
};
priority_queue <int,vector<int>,compara>q;
void dijkstra(int x)
{
    for(int i=1;i<=n;i++)
        dist[i]=INT_MAX;
   dist[x]=0;
    q.push(x);
    while(!q.empty())
    {
        int nod=q.top(); q.pop(); viz[nod]=0;
        for(int j=0;j<v[nod].size();j++)
        {
            int vecin=v[nod][j].first;
            int cost=v[nod][j].second;
            if(dist[vecin]>dist[nod]+cost)
            {
                dist[vecin]=dist[nod]+cost;
                if(viz[x]==0)
                {
                    viz[x]=1;
                     q.push(vecin);
                }

            }
        }
    }
}

void citire()
{
    in>>n>>m;
    for(int i=1;i<=m;i++)
    {
        int x,y,c; in>>x>>y>>c;
        v[x].push_back({y,c});
    }
}
int main()
{
    citire();
    dijkstra(1);
    for(int i=2;i<=n;i++)
        if(dist[i]!=INT_MAX)
        out<<dist[i]<<" ";
    else
        out<<0<<" ";
    return 0;
}