#include <iostream>
#include <fstream>
#include <vector>
#include <stack>
#include <algorithm>
#include <cmath>
#include <iomanip>
#include <queue>
using namespace std;
ifstream fin("dijkstra.in");
ofstream fout("dijkstra.out");
int n,m;
struct muchie{
   int vecin;
   int cost;
};
vector <vector<muchie>>G;
vector <int>dist;
vector <bool> viz;
struct cmp{
   bool operator()(int x,int y)
   {
       return dist[x]>dist[y];
   }
};
priority_queue <int, vector<int>, cmp>coada;
const int inf=2000000000;
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(int i=0;i<G[nodcurent].size();i++)
        {
            int vecin=G[nodcurent][i].vecin;
            int cost=G[nodcurent][i].cost;
            if(dist[nodcurent]+cost<dist[vecin])
            {
                dist[vecin]=dist[nodcurent]+cost;
                if(!viz[vecin])
                {
                    coada.push(vecin);
                    viz[vecin]=1;
                }
            }
        }
    }
}
void citire()
{
    fin>>n>>m;
    int x,y,cost;
    G.resize(n+1);
    dist.resize(n+1);
    viz.resize(n+1);
    for(int i=0;i<m;i++)
    {
        fin>>x>>y>>cost;
        G[x].push_back({y,cost});
    }
    dijkstra(1);
    for(int i=2;i<=n;i++)
    {
        if(dist[i]!=inf)
            fout<<dist[i]<<" ";
        else
            fout<<"0"<<" ";
    }
}
int main()
{
    citire();
    return 0;
}