#include <bits/stdc++.h>
#define cst first
#define vec second
using namespace std;
ifstream f("dijkstra.in");
ofstream g("dijkstra.out");
const int N = 50010;
const int oo = 1000000010;
vector<pair<int,int>> v[N];
vector<int> d(N,oo);
priority_queue<pair<int,int>>q;
bitset<N> viz;
int n,m,i,j,c;
int main()
{
    f>>n>>m;
    for(; m; m--)
    {
        f>>i>>j>>c;
        v[i].push_back(make_pair(j,c));

    }
    q.push(make_pair(0,1));
    d[1]=0;
    viz[1]=1;
    while(q.size())
    {
        tie(c,i)=q.top();
        q.pop();
        if(viz[i])continue;
        viz[i]=1;
        for(auto it:v[i])
            if(it.cst-c<d[it.vec])
            {
                d[it.vec]=it.cst-c;
                q.push(make_pair(-d[it.vec],it.vec));
            }
    }
    for(i=2;i<=n;i++)
        g<<d[i]<<' ';
    return 0;
}