#include <bits/stdc++.h>

using namespace std;
ifstream f("dijkstra.in");
ofstream g("dijkstra.out");
const int N=100001,oo=1000000001;
int n,m,s,d[N];
vector<pair<int,int>> v[N];
priority_queue<pair<int,int>> pq;
int main()
{
    f>>n>>m;
    for(;m;m--)
    {
        int x,y,c;
        f>>x>>y>>c;
        v[x].push_back(make_pair(y,c));
    }
    pq.push(make_pair(0,1));
    fill(d+1,d+n+1,oo);
    d[1]=0;
    while(pq.size())
    {
        int nod,cost;
        tie(cost,nod)=pq.top();
        pq.pop();
        cost=-cost;
        if(cost>d[nod])
            continue;
        for(auto it:v[nod])
        {
            int vec,edgeCost;
            tie(vec,edgeCost)=it;
            if(d[vec]>cost+edgeCost)
            {
                d[vec]=cost+edgeCost;
                pq.push(make_pair(-d[vec],vec));
            }
        }
    }
    for(int i=2;i<=n;i++)
    {
        if(d[i]==oo)
            d[i]=0;
        g<<d[i]<<' ';
    }
    return 0;
}