#include <iostream>
#include <queue>
#include <fstream>
#include <vector>
#define pb push_back
#define NM 50005
using namespace std;
ifstream in("dijkstra.in");
ofstream out("dijkstra.out");
struct dagon
{
    int nod,cost;
    bool operator < (const dagon &other) const
    {
        return cost>other.cost;
    }
};
dagon ms(int nn,int cc)
{
    dagon fr;
    fr.nod=nn;
    fr.cost=cc;
    return fr;
}
dagon fr;
int n,m,a,b,c,dmin[NM],fol[NM];
vector<dagon> v[NM];
priority_queue<dagon> q;
int main()
{
    in>>n>>m;
    for(int i=1;i<=n;++i)dmin[i]=(1<<30);
    q.push(ms(1,0));
    for(int i=1;i<=m;++i)
    {
        in>>a>>b>>c;
        v[a].pb(ms(b,c));
        v[b].pb(ms(a,c));
    }
    dmin[1]=0;
    while(!q.empty())
    {
        fr=q.top();
        q.pop();
        if(!fol[fr.nod])
        {
            fol[fr.nod]=1;
            for(auto s:v[fr.nod])
            {
                if(!fol[s.nod] && dmin[s.nod]>dmin[fr.nod]+s.cost)
                {
                    dmin[s.nod]=dmin[fr.nod]+s.cost;
                    q.push(ms(s.nod,dmin[s.nod]));
                }
            }
        }
    }
    for(int i=2;i<=n;++i)out<<dmin[i]<<" ";
    return 0;
}