#include <bits/stdc++.h>
#define oo 2000000000
#define NMAX 50005
using namespace std;

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

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

int n, m;
int dist[NMAX];
vector<muchie> L[NMAX];
priority_queue<muchie> q;

void Dijkstra()
{
    for(int i=1; i<=n; i++)
        dist[i] = oo;
    dist[1] = 0;
    muchie aux;
    aux.nod = 1;
    aux.cost = 0;
    q.push(aux);
    while(!q.empty())
    {
        aux = q.top();
        q.pop();
        int nod = aux.nod;
        for(auto it: L[nod])
        {
            if(dist[nod] + it.cost < dist[it.nod])
            {
                //cout<<dist[nod] + it.cost<<" "<< dist[it.nod] <<"\n";
                dist[it.nod] = dist[nod] + it.cost;
                q.push(it);
            }
        }
    }
    for(int i=2; i<=n; i++)
        fout<<dist[i]<<" ";
}

int main()
{
    fin>>n>>m;
    for(int i=1; i<=m; i++)
    {
        muchie aux;
        int x, y;
        fin>>x>>y>>aux.cost;
        aux.nod = y;
        L[x].push_back(aux);
        aux.nod = x;
        L[y].push_back(aux);
    }
    Dijkstra();
    return 0;
}