#include <iostream>
#include <vector>
#define Nmax 50005
#include <fstream>
#include <climits>
#include <queue>
using namespace std;
ifstream fin("dijkstra.in");
ofstream fout("dijkstra.out");
int n,m,d[Nmax];
bool visited[Nmax];
vector<pair<int,int>>graf[Nmax];
struct comparad{
bool operator()(int x,int y)
{
    return d[x]>d[y];
}
};
priority_queue < int, vector <int>, comparad > coada;
void Dijkstra(int nod)
{
    coada.push(nod);
    d[nod]=0;
    visited[1]=1;
    while(!coada.empty())
    {
        int current=coada.top();
        visited[current]=0;
        coada.pop();
        for(auto i : graf[current])
           {
            int cost = i.second;
            int vecin=i.first;
            if(d[vecin]>d[current]+cost)
                {
                d[vecin]=d[current]+cost;
                if(!visited[vecin])
                {
                visited[vecin]=1;
                coada.push(vecin);
                }
                }
            }
    }
}
int main()
{
    fin>>n>>m;
    int i,x,y,c;
    for(i=1;i<=m;++i)
    {
        fin>>x>>y>>c;
        graf[x].push_back({y,c});
    }
    for(i=1;i<=n;++i)
        d[i]=INT_MAX;
    Dijkstra(1);
    for(i=2;i<=n;++i)
    {
        if(d[i]==INT_MAX)fout<<0<<' ';
        else fout<<d[i]<<' ';
    }
    return 0;
}