#include <iostream>
#include <vector>
#include <queue>
#include <limits>
#include <fstream>
using namespace std;
ifstream fin("dijkstra.in");
ofstream fout("dijkstra.out");

int m, n;
vector<vector<pair<int,int>>> lista;
int visited[1000];

void dijkstra(int start) {
    vector<int> dist(n + 1, numeric_limits<int>::max());

    priority_queue<
        pair<int,int>,
        vector<pair<int,int>>,
        greater<pair<int,int>>
    > pq;

    dist[start] = 0;
    pq.push({0, start});

    while (!pq.empty()) {
        auto [d, node] = pq.top();
        pq.pop();

        if (visited[node]) continue;
        visited[node] = 1;

        for (auto &[next, cost] : lista[node]) {
            if (dist[next] > d + cost) {
                dist[next] = d + cost;
                pq.push({dist[next], next});
            }
        }
    }

    for (int i = 1; i <= n; i++)
        fout << i << ": " << dist[i] << "\n";
}

int main() {
    fin >> m >> n;
    lista.resize(n + 1);

    for (int i = 0; i < m; i++) {
        int a, b, c;
        fin >> a >> b >> c;
        lista[a].push_back({b, c});
    }

    dijkstra(1);
}