#include <bits/stdc++.h>
using namespace std;

struct Edge {
    int to;
    int weight;
};

struct AdjList {
    vector<Edge> edges;
};

void Dijkstra(vector<AdjList>& graph, int start, vector<int>& distance) {
    int n = graph.size();
    vector<bool> visited(n, false);
    distance[start] = 0;

    priority_queue<pair<int, int>, vector<pair<int, int>>, greater<pair<int, int>>> pq;
    pq.push(make_pair(0, start));

    while (!pq.empty()) {
        int u = pq.top().second;
        pq.pop();
        visited[u] = true;
        for (const Edge& edge : graph[u].edges) {
            int v = edge.to;
            int weight = edge.weight;
            if (!visited[v] && distance[u] + weight < distance[v]) {
                distance[v] = distance[u] + weight;
                pq.push(make_pair(distance[v], v));
            }
        }
    }
}

int main() {
    int n, m, s;
    cin >> n >> m >> s;

    vector<AdjList> graph(n + 1); 
    vector<int> distance(n + 1, INT_MAX); 

    for (int i = 0; i < m; i++) {
        int u, v, w;
        cin >> u >> v >> w;
        graph[u].edges.push_back({v, w});
    }

    Dijkstra(graph, s, distance);

    for (int i = 1; i <= n; i++) {
        cout << distance[i] << " ";
    }
    cout << endl;

    return 0;
}