#define NDEBUG #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>> node1; vector<i64> dist(n, INF); vector<vector<vector<bool>>> vis(n, vector<vector<bool>>(k + 1, vector<bool>(k + 1, false))); dist[s] = 0; node1.emplace(0, s); while (!node1.empty()) { pair<i64, int> top_pair = node1.top(); node1.pop(); i64 dis = -top_pair.first; int cur = top_pair.second; if (dis != dist[cur]) continue; for (const auto& edge : graph[cur]) { int nxt = edge.first; int cost = edge.second; if (dist[nxt] > dist[cur] + cost) { dist[nxt] = dist[cur] + cost; node1.emplace(-dist[nxt], nxt); } } queue<tuple<int, int, int>> node2; node2.emplace(cur, 0, 0); while (!node2.empty()) { tuple<int, int, int> front_tuple = node2.front(); node2.pop(); int u = get<0>(front_tuple); int i = get<1>(front_tuple); int j = get<2>(front_tuple); vis[u][i][j] = true; if (i == k && dist[u] > dis + a[j]) { dist[u] = dis + a[j]; node1.emplace(-dist[u], u); } else if (i < k) { if (!vis[u][i + 1][j]) node2.emplace(u, i + 1, j); if (!vis[u ^ (1 << i)][i + 1][j + 1]) node2.emplace(u ^ (1 << i), i + 1, j + 1); } } } for (int i = 0; i < n; ++i) cout << dist[i] << ' '; return 0; }