#include <fstream>
#include <utility>
#include <vector>
#include <set>
#define N 50010
#define oo 1000000000
using namespace std;
ifstream f("dijkstra.in");
ofstream g("dijkstra.out");
vector<pair<int,int> > v[N];
set<pair<int,int> > q;
int n,m,a,b,c,i,d[N],viz[N];
pair<int,int> j;
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.insert(make_pair(0,1));
    while(q.size())
    {
        j=*q.begin();
        c=j.first;
        a=j.second;
        q.erase(j);
        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.insert(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;
}