#include <bits/stdc++.h>
using namespace std;
ifstream f("dijkstra.in");
ofstream g("dijkstra.out");
const int N=50010,oo=1000000000;
vector<pair<int,int> > v[N];
priority_queue<pair<int,int> > q;
int n,m,a,b,c,i,d[N],viz[N];
pair<int,int> P;
int main()
{
    f>>n>>m;
    for(;m;m--)
    {
        f>>a>>b>>c;
        v[a].push_back(make_pair(b,c));
    }
    for(i=2;i<=n;i++)d[i]=oo;
    q.push(make_pair(0,1));
    while(q.size())
    {
        tie(c,a)=q.top();
        c=-c;
        q.pop();
        if(viz[a])continue;
        viz[a]=1;
        for(auto it:v[a])
            if(d[it.first]>c+it.second)
            {
                d[it.first]=c+it.second;
                q.push(make_pair(-d[it.first],it.first));
            }
    }
    for(i=2;i<=n;i++)
    {
        if(d[i]==oo)g<<"0 ";
        else g<<d[i]<<' ';
    }

    return 0;
}