#include <iostream>
#include <fstream>
#include <queue>
#include <vector>
#define MAX 50005
#define INF 200005
using namespace std;
ifstream fin("dijkstra.in");
ofstream fout("dijkstra.out");
int n,m;
vector <pair <int,int>> G[MAX];
int dist[MAX];
bool viz[MAX];
int tati[MAX];
struct comparator
{
    bool operator() (int x,int y)
    {
        return dist[x]>dist[y];
    }
};
priority_queue <int, vector <int>, comparator>coada;
void citire()
{
    fin>>n>>m;
    int x,y,cost;
    for(int i=1; i<=m; i++)
    {
        fin>>x>>y>>cost;
        G[x].push_back(make_pair(y,cost));
    }
}
void dijkstra(int nod)
{
    viz[nod]=1;
    for(int i=1;i<=n;i++)
    {
        dist[i]=INF;
    }
    dist[nod]=0;
    coada.push(nod);
    while(!coada.empty())
    {
        int nodcurent=coada.top();
        coada.pop();
        viz[nodcurent]=0;
        for(size_t i=0;i<G[nodcurent].size();i++)
        {
            int vecin=G[nodcurent][i].first;
            int cost=G[nodcurent][i].second;
            if(dist[nodcurent]+cost<dist[vecin])
            {
                dist[vecin]=dist[nodcurent]+cost;
                if(!viz[vecin])
                {
                    coada.push(vecin);
                    viz[vecin]=1;
                }
            }
        }
    }

}
void afisare()
{
    for(int i=2; i<=n; i++)
    {
        if(dist[i]!=INF)
            fout<<dist[i]<<" ";
        else
            fout<<"0"<<" ";
    }
}
int main()
{
    citire();
    dijkstra(1);
    afisare();
    return 0;
}