#include <iostream>
#include <queue>
#include <vector>

std::vector<int> dijkstra(int N,
                          std::vector<std::vector<std::pair<int, int>>> G,
                          int s) {
    using P = std::pair<int, int>;
    std::vector<int> dist(N, INT32_MAX);
    std::priority_queue<P, std::vector<P>, std::greater<P>> q;
    dist.at(s) = 0;
    q.emplace(0, s);
    while (q.size()) {
        auto [c, v] = q.top();
        q.pop();
        if (dist.at(v) < c) continue;
        for (const auto& [t, cost] : G.at(v)) {
            if (dist.at(v) + cost < dist.at(t)) {
                dist.at(t) = dist.at(v) + cost;
                q.emplace(dist.at(t), t);
            }
        }
    }
    return dist;
}

int main() {
    int N, M, L;
    std::cin >> N >> M >> L;
    L--;
    std::vector<int> T(N);
    for (int i = 0; i < N; i++) {
        std::cin >> T[i];
    }
    std::vector<std::vector<std::pair<int, int>>> G(N);
    for (int i = 0; i < M; i++) {
        int a, b, c;
        std::cin >> a >> b >> c;
        a--;
        b--;
        G.at(a).emplace_back(b, c);
        G.at(b).emplace_back(a, c);
    }

    std::vector<std::vector<int>> dist_all(N);
    for (int s = 0; s < N; s++) {
        dist_all.at(s) = dijkstra(N, G, s);
    }
    int ans = INT32_MAX;
    for (int t = 0; t < N; t++) {
        int s = 0;
        for (int x = 0; x < N; x++) {
            s += T[x] * 2 * dist_all[x][t];
        }
        int m = 0;
        for (int x = 0; x < N; x++) {
            if (T[x] == 0) continue;
            int tmp_m = dist_all[t][x] - dist_all[L][x];
            if (m < tmp_m)
                ;
            m = tmp_m;
        }
        if (ans > s - m) ans = s - m;
    }
    std::cout << ans << std::endl;
}