#include <fstream>
#include <list>
#include <queue>
#define DIM 50001
#define INF 999999

using namespace std;

int n,m,x,y,c,d[DIM];
list<pair<int , int> >nod[DIM];
queue<int> cd;

void bellmanford(int k)
{
    cd.push(k);
    while(!cd.empty())
    {
        int vf=cd.front();
        for(list<pair<int,int> >::iterator i=nod[vf].begin();i!=nod[vf].end();++i)
        {
            std::pair<int,int> q=*i;
            if(d[q.first]>d[vf]+q.second)
            {
                d[q.first]=d[vf]+q.second;
                cd.push(q.first);
            }
        }
        cd.pop();
    }
}

int main()
{
    ifstream f("dijkstra.in");
    ofstream g("dijkstra.out");
    f>>n>>m;
    for(int i=1;i<=m;++i)
    {
        f>>x>>y>>c;
        nod[x].push_back(make_pair(y,c));
        nod[y].push_back(make_pair(x,c));
    }
    for(int i=2;i<=n;++i)
    d[i]=INF;
    bellmanford(1);
    for(int i=2;i<=n;++i)
    {
        if(d[i]==INF) g<<"0 ";
        else
        g<<d[i]<<" ";
    }
    g<<'\n';
    f.close();
    g.close();
    return 0;
}