#include <bits/stdc++.h>
#define cin fin
#define cout fout
#define oo 1<<30
using namespace std;
ifstream cin ("dijkstra.in");
ofstream cout ("dijkstra.out");
int n,m,a,b,c,i,j,k,v[50008],incoada[50008];
vector<pair<int,int>>G[50008];
struct compar{
    bool operator()(int a,int b)
    {
        return v[a]>v[b];
    }
};
priority_queue<int,vector<int>,compar>Q;
void Dijkstra(int nod)
{
    for(i=1;i<=n;i++)
    {
        v[i]=oo;
    }
    Q.push(nod);
    v[nod]=0;
    incoada[nod]=1;
    while(!Q.empty())
    {
        k=Q.top();
        Q.pop();
        incoada[k]=0;
        for(auto i:G[k])
        {
            if(v[i.first]>v[k]+i.second)
            {
                v[i.first]=v[k]+i.second;
                if(incoada[i.first]==0)
                {
                    incoada[i.first]=1;
                    Q.push(i.first);
                }
            }
        }
    }
}
int main()
{
    cin>>n>>m;
    for(i=1;i<=m;i++)
    {
        cin>>a>>b>>c;
        G[a].push_back({b,c});
    }
    Dijkstra(1);
    for(i=2;i<=n;i++)
    {
        if(v[i]==oo)
            cout<<"0";
            else
            cout<<v[i];
        cout<<" ";
    }
    return 0;
}