#include<bits/stdc++.h>
#define cin fin
#define cout fout
#define Nmax 50008
#define oo 1<<30
using namespace std;
ifstream cin("dijkstra.in");
ofstream cout("dijkstra.out");
int n,m,i,j,v[Nmax],incoada[Nmax],k;
struct compar
{
    bool operator()(int a,int b)
    {
        return v[a]>v[b];
    }
};
priority_queue<int,vector<int>,compar> Q;
vector<pair<int,int>> G[Nmax];
void Dijkstra(int nodstart)
{
    for(i=1; i<=n; i++)
        v[i]=oo;
    Q.push(nodstart);
    incoada[nodstart]=1;
    v[nodstart]=0;
    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;
    int a,b,c;
    for(i=1; i<=m; i++)
    {
        cin>>a>>b>>c;
        G[a].push_back(make_pair(b,c));
    }
    Dijkstra(1);
    for(i=2; i<=n; i++)
    {
        if(v[i]==oo)
            cout<<"0 ";
        else
            cout<<v[i]<<" ";
    }
}