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

#define INFINIT 32000
using namespace std;

vector<pair<int,int> > G[50002];



int main()
{
    ifstream f("dijkstra.in");
    ofstream g("dijkstra.out");
    priority_queue<pair<int,int>,vector<pair<int,int> >,greater<pair<int,int> > > pq;

    int N,M,i,x,y,z,d[50002],curent,viz[50002];
    f>>N>>M;
    for(i=1;i<=M;i++)
    {
        f>>x>>y>>z;
        G[x].push_back(make_pair(z,y));
        G[y].push_back(make_pair(z,x));
    }
    d[1]=0;
    for(i=2;i<=N;i++)
    {
        d[i]=INFINIT;
        viz[i]=0;
    }


    pq.push(make_pair(0,1));

    while(!pq.empty())
    {
        curent=pq.top().second;
        pq.pop();
        if(!viz[curent])
        {
            for(vector<pair<int,int> >::iterator it=G[curent].begin();it!=G[curent].end();it++)
        {

            if ( d[it->second] > (d[curent] + it->first) )
            {
                d[it->second] = (d[curent] + it->first);
                pq.push(make_pair(d[it->second],it->second));
            }

        }
        viz[curent]=1;
        }

    }
    for(i=2;i<=N;i++) g<<d[i]<<" ";


    f.close();
    g.close();
    return 0;
}