#include <bits/stdc++.h>

using namespace std;
ifstream f("bellmanford.in");
ofstream g("bellmanford.out");
const int N = 50010;
const int oo = N*1001;
int n,m,cost[N];
vector<pair<int,int>> v[N];
queue<int> q;
int main()
{
    f>>n>>m;
    for(int i=1;i<=m;i++)
    {
        int x,y,c;
        f>>x>>y>>c;
        v[x].push_back(make_pair(y,c));
    }
    for(int i=1;i<=n;i++)
        cost[i]=oo;
    cost[1]=0;
    q.push(1); /// oarecum similar cu ideea de la BFS !!!
    while(q.size())
    {
        int nod=q.front();
        q.pop();
        int cost_nod=cost[nod];
        for(auto it:v[nod])
        {
            int vec,cost_arc;///vec=it.first,cost_arc=it.second;
            tie(vec,cost_arc)=it; /// iau elementul din lista de vecini si distribui perechea pe doua variabile
            if(cost_nod+cost_arc<cost[vec])
            {
                cost[vec]=cost_nod+cost_arc;
                q.push(vec);
            }
        }
    }
    for(int i=2;i<=n;i++)
        g<<cost[i]<<' ';
    g<<'\n';
    return 0;
}