#include <fstream>
#include <queue>
#include <unordered_map>
#include <vector>
#include <algorithm>
#include <bitset>
#include <climits>
#include <set>
#include <cmath>
using namespace std;



ifstream cin("dijkstra.in");
ofstream cout("dijkstra.out");

int n, m, l, c, v;
vector<pair<int, int>> g[50005];
vector<int> dist(50005, INT_MAX);

inline void dijkstra()
{
    priority_queue<pair<int, int>, vector<pair<int, int>>, greater<pair<int, int>>> q;
    q.push(make_pair(0,1));
    dist[1] = 0;
    while(!q.empty())
    {
        int node = q.top().second;
        int val = q.top().first;
        q.pop();
        for(auto x : g[node])
            if(dist[x.first] > dist[node] + x.second)
            {
                dist[x.first] = dist[node] + x.second;
                q.push(make_pair(dist[x.first], x.first));
            }
    }
}

int main()
{
    cin>>n>>m;
    for(int x = 1 ; x <= m ; x++)
    {
        cin>>l>>c>>v;
        g[l].push_back(make_pair(c, v));
    }
    dijkstra();
    for(int x = 2 ; x <= n ; x++)
    {
        if(dist[x] != INT_MAX)
            cout<<dist[x]<<' ';
        else
            cout<<0<<' ';
    }
}