#include <bits/stdc++.h>

using namespace std;

constexpr int NMax=50005;
constexpr int INF=999999;

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

int N,M;
vector< pair<int,int> > G[NMax];
int Dist[NMax];
priority_queue< pair<int,int>, vector< pair<int,int> >, greater< pair<int,int> > > Queue;

void Dijkstra(int source)
{
    for(int i=1;i<=N;i++)
        Dist[i]=INF;

    Dist[source]=0;
    Queue.push({Dist[source],source});
    while(!Queue.empty())
    {
        int node=Queue.top().second;
        int d=Queue.top().first;
        Queue.pop();
        if(Dist[node]!=d)
            continue;
        for(auto child : G[node])
        {
            int to=child.first;
            int cost=child.second;
            if(Dist[to]>=Dist[node]+cost)
            {
                Dist[to]=Dist[node]+cost;
                Queue.push({Dist[to],to});
            }
        }
    }
}

int main()
{
    fin>>N>>M;
    for(int i=1;i<=M;i++)
    {
        int x,y,z;
        fin>>x>>y>>z;
        G[x].push_back({y,z});
    }

    Dijkstra(1);

    for(int i=2;i<=N;i++)
        if(Dist[i]>=INF)
            fout<<"0 ";
        else
            fout<<Dist[i]<<" ";

    return 0;
}