#include<fstream>
#include<vector>
#include<utility>
#include<queue>
using namespace std;
vector<pair<int,int> > v[50001];
class queue_C
{
public:
    bool operator () (pair<int,int> a,pair<int,int> b)
    {
        return a.second>b.second;
    }
};
priority_queue<pair<int,int>,vector<pair<int,int> >,queue_C> q;
ifstream fin("dijkstra.in");
ofstream fout("dijkstra.out");
int n,m,pret[50001],i,x,y,c,ok;
pair<int,int> aux;
int main()
{
    fin>>n>>m;
    for(i=1; i<=m; i++)
    {
        fin>>x>>y>>c;
        v[x].push_back(make_pair(y,c));
        v[y].push_back(make_pair(x,c));
    }
    for(i=2;i<=n;i++)pret[i]=500000000;
    pret[1]=0;
    q.push(make_pair(1,0));
    while(!q.empty())
    {
        aux=q.top();
        q.pop();
        if(ok==1)break;
        for(vector<pair<int,int> >::iterator i=v[aux.first].begin(); i!=v[aux.first].end(); i++)
        {
            if(pret[(*i).first]>pret[aux.first]+(*i).second)
            {
                q.push(make_pair((*i).first,pret[aux.first]+(*i).second));
                pret[(*i).first]=pret[aux.first]+(*i).second;
            }
        }
    }
    for(i=2; i<=n; i++)
        fout<<pret[i]<<' ';
    return 0;
}