#include <iostream>
#include <fstream>
#include <algorithm>
#include <cassert>
#include <cmath>
#include <vector>
#include <map>
#include <iomanip>
#include <bitset>
#include <queue>
#include <unordered_set>
#include <unordered_map>
#include <string>
#include <climits>
#include <cstring>

#define LL long long
#define billion 1000000000
const LL mod = 666013;
const double pi = 3.14159265359;

#define maxn 505

using namespace std;

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

int n, m;

vector< vector<pair<int, int>> > Graph;
vector<int> minDist;
vector<bool> visited;

struct compareNodes{
    bool operator() (int node1, int node2) {
        return minDist[node1] < minDist[node2];
    }
};

int main() 
{   
    fin >> n >> m;
    Graph = vector< vector<pair<int, int>> >(n+1);
    
    int from, to, weight;
    for (int i = 0; i < m; i++) {
        fin >> from >> to >> weight;
        Graph[from].push_back({ to, weight });
    }

    minDist = vector<int>(n + 1, INT_MAX / 2);
    visited = vector<bool>(n + 1);
    minDist[1] = 0;
    priority_queue<int, vector<int>, compareNodes> Heap;
    Heap.push(1);

    while (!Heap.empty()) {
        int currNode = Heap.top();
        Heap.pop();

        if (visited[currNode])
            continue;
        visited[currNode] = true;

        for (auto edge : Graph[currNode]) {
            int nextNode = edge.first;
            int w = edge.second;

            if (minDist[currNode] + w < minDist[nextNode]) {
                minDist[nextNode] = minDist[currNode] + w;
                Heap.push(nextNode);
            }
        }
    }

    for (int i = 2; i <= n; i++) {
        if (minDist[i] != INT_MAX / 2)
            fout << minDist[i] << " ";
        else
            fout << "0 ";
    }
    return 0;
}