#include <bits/stdc++.h>
#define oo 2e9
using namespace std;

ifstream fin("dijkstra.in");
ofstream fout("dijkstra.out");

int n , m , d[50005] , viz[50005];
vector<pair<int , int>> L[50005];
priority_queue<pair<int , int>> q;

void Dijkstra(int start)
{
    int i , k;
    for(i = 1;i <= n;i++)
    {
        viz[i] = 0;
        d[i] = oo;
    }
    d[start] = 0;
    q.push({0 , start});
    while(!q.empty())
    {
        int k = q.top().second;
        if(viz[k] == 0)
        {
            viz[k] = 1;
            for(auto e : L[k])
                if(e.second - q.top().first < d[e.first])
                {
                    d[e.first] = e.second - q.top().first;
                    q.push({-d[e.first] , e.first});
                }
        }
        q.pop();
    }
}

int main()
{
    int i , j , k , c;
    fin >> n >> m;
    for(k = 1;k <= m;k++)
    {
        fin >> i >> j >> c;
        L[i].push_back({j , c});
    }
    Dijkstra(1);
    for(i = 2;i <= n;i++)
        if(d[i] != oo) fout << d[i] << " ";
        else fout << "0 ";
    return 0;
}