#include <iostream>
#include <vector>
#include <queue>
#include <fstream>

using namespace std;

int viz[100005];
int dist[100005];
vector <int> graph[100005];
vector <int> graphC[100005];

void Dijkstra(int N)
{
    int t,i;
    for(t=0;t<N;t++)
    {
        int index;
        int distmin=1000000000;
        for(i=1;i<=N;i++)
            if(viz[i]==0 && dist[i]<distmin)
            {
                distmin=dist[i];
                index=i;
            }
        viz[index]=1;
        int lim=graph[index].size();
        for(i=0;i<lim;i++)
        {
            int vecin=graph[index][i];
            if(dist[vecin] > dist[index]+graphC[index][i])
                dist[vecin]=dist[index]+graphC[index][i];
        }
    }
}
int main()
{
    ifstream in("bfs.in");
    ofstream out("bfs.out");
    int N,M,x,y,cost;
    in>>N>>M;
    int i;
    for(i=0;i<M;i++)
    {
        in>>x>>y>>cost;
        graph[x].push_back(y);
        graphC[x].push_back(cost);
    }
    dist[1]=0;
    for(i=2;i<=N;i++)
        dist[i]=1000000000;
    Dijkstra(N);
    for(i=1;i<=N;i++)
        if(dist[i]==1000000000)
            dist[i]=0;
    for(i=2;i<=N;i++)
        out<<dist[i]<<" ";
    return 0;
}