#include <iostream>
#include <fstream>
#include <vector>
#include <queue>
using namespace std;


ifstream fin("dijkstra.in");
ofstream fout("dijkstra.out");


int n,m;


int d[50005];


struct muchie
{
    int vecin;
    int cost;
    bool operator < (const muchie &A) const
    {
        return cost > A.cost;
    }
};


vector <muchie> g[50005];


priority_queue <muchie> pq;


void read()
{
    fin>>n>>m;
    int x,y,cost;
    for(int i=1;i<=m;i++)
    {
        fin>>x>>y>>cost;
        g[x].push_back({y,cost});
    }
}


void dijkstra(int sursa)
{
    for(int i=2;i<=n;i++)
        d[i]=1e9;
    pq.push({sursa,0});
    while(!pq.empty())
    {
        int nod=pq.top().vecin;
        pq.pop();
        for(auto it:g[nod])
        {
            if(d[it.vecin]>d[nod]+it.cost)
            {
                d[it.vecin]=d[nod]+it.cost;
                pq.push({it.vecin,d[it.vecin]});
            }
        }
    }
    for(int i=2;i<=n;i++)
    {
        if(d[i]!=1e9)
            fout<<d[i]<<" ";
        else fout<<0<<" ";
    }
}


int main()
{
    read();
    dijkstra(1);
    return 0;
}