#include <bits/stdc++.h>
using namespace std;
ifstream fin("dijkstra.in");
ofstream fout("dijkstra.out");
struct ceva
{
    int nod;
    long long cost;
    bool operator < (const ceva &other)const
    {
        return cost>other.cost;
    }
}gr;
priority_queue<ceva>q;
vector<ceva>v[50010];
int n,m,i,j,a,b,x,nod;
bool viz[50010];
long long d[50010],c;
int main()
{
    fin>>n>>m;
    for(i=1;i<=n;i++)
        d[i]=INT_MAX,viz[i]=false;
    for(i=1;i<=m;i++)
    {
        fin>>a>>b>>c;
        gr.nod=b;
        gr.cost=c;
        v[a].push_back(gr);
    }
    gr.nod=1;
    gr.cost=0;
    d[1]=0;
    q.push(gr);
    while(!q.empty())
    {
        ceva u=q.top();
        q.pop();
        if(!viz[u.nod])
        {
            viz[u.nod]=true;
            for(auto it=v[u.nod].begin();it!=v[u.nod].end();++it)
            {
                ceva v=*it;
                a=v.nod;
                b=v.nod;
                if(d[v.nod]>d[u.nod]+v.cost)
                {
                    d[v.nod]=d[u.nod]+v.cost;
                    gr.nod=v.nod;
                    gr.cost=d[v.nod];
                    q.push(gr);
                }
            }
        }
    }
    for(i=2;i<=n;i++)
        if(d[i]!=INT_MAX)
            fout<<d[i]<<" ";
        else fout<<"0 ";
    return 0;
}