#include <bits/stdc++.h>

using namespace std;
ifstream f("bellmanford.in");
ofstream g("bellmanford.out");
const int N = 50010;
const int oo = 500000010;
int n,m,x,y,c,i,d[N];
vector<pair<int,int>> v[N];
queue<int> q;
int main()
{
    f>>n>>m;
    for(;m;m--)
    {
        f>>x>>y>>c;
        v[x].push_back(make_pair(y,c));
    }
    for(i=1;i<=n;i++)
        d[i]=oo;
    d[1]=0;
    q.push(1);
    while(q.size())
    {
        x=q.front();
        q.pop();
        for(auto it:v[x])
        {
            y=it.first;
            c=it.second;
            if(d[y]>d[x]+c)
            {
                d[y]=d[x]+c;
                q.push(y);
            }
        }
    }
    for(i=2;i<=n;i++)
        g<<d[i]<<' ';
    return 0;
}