#include <iostream> #include <queue> #include <tuple> #include <utility> #include <vector> using namespace std; using i64 = long long; constexpr i64 INF = 0x3f3f3f3f3f3f3f3f; int main() { ios::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr); int k, m, s; cin >> k >> m >> s; vector<int> a(k + 1); for (int i = 1; i <= k; ++i) cin >> a[i]; int n = 1 << k; vector<vector<pair<int, int>>> graph(n); for (int i = 0; i < m; ++i) { int u, v, c; cin >> u >> v >> c; graph[u].emplace_back(v, c); graph[v].emplace_back(u, c); } priority_queue<pair<i64, int>> nodes1; vector<vector<vector<bool>>> vis(n, vector<vector<bool>>(k + 1, vector<bool>(k + 1, false))); vector<i64> dist(n, INF); dist[s] = 0; nodes1.emplace(0, s); while (!nodes1.empty()) { pair<i64, int> node1 = nodes1.top(); int dis = -get<0>(node1), cur = get<1>(node1); nodes1.pop(); if (dis != dist[cur]) continue; for (auto edge : graph[cur]) { int nxt = edge.first, cost = edge.second; if (dist[nxt] > dist[cur] + cost) { dist[nxt] = dist[cur] + cost; nodes1.emplace(-dist[nxt], nxt); } } vector<tuple<int, int, int>> nodes2; nodes2.emplace_back(cur, 0, 0); while (!nodes2.empty()) { tuple<int, int, int> node2 = nodes2.back(); int u = get<0>(node2), i = get<1>(node2), j = get<2>(node2); nodes2.pop_back(); if (vis[u][i][j]) continue; vis[u][i][j] = true; if (i == k && dist[u] > dis + a[j]) { dist[u] = dis + a[j]; nodes1.emplace(-dist[u], u); } else if (i < k) { nodes2.emplace_back(u, i + 1, j); nodes2.emplace_back(u ^ (1 << i), i + 1, j + 1); } } } for (int i = 0; i < n; ++i) cout << dist[i] << ' '; return 0; }