#include <bits/stdc++.h>

using namespace std;

ifstream f("dijkstra.in");
ofstream g("dijkstra.out");

const int N = 50002;
const int INF = 1000000002;
vector <pair <int,int> > v[N];
int n,m,d[N];
priority_queue <pair <int,int> > pq;
bitset <N> viz;
int main()
{
    f>>n>>m;
    for(;m;m--)
    {
        int x,y,z;
        f>>x>>y>>z;
        v[x].push_back(make_pair(y,z));
    }
    for(int i=1;i<=n;i++)
        d[i]=INF;
    d[1]=0;
    pq.push(make_pair(0,1));
    while(pq.size())
    {
        int cost, nod;
        tie(cost,nod)=pq.top();
        pq.pop();
        if(viz[nod])
            continue;
        viz[nod]=1;
        cost = -cost;
        for(auto it:v[nod])
        {
            int vec,cst;
            tie(vec,cst)=it;
            if(cost+cst<d[vec])
            {
                d[vec]=cost+cst;
                pq.push(make_pair(-d[vec],vec));
            }
        }
    }
    for(int i=2;i<=n;i++)
        {
            if(d[i]==INF)
                d[i]=0;
            g<<d[i]<<' ';
        }
    return 0;
}