#include <bits/stdc++.h>

using namespace std;

using int64 = long long;
const int64 INF = 1LL << 60;


int main() {
  int N, M, L;
  int64 v[2000][2000];
  fill_n(*v, 2000 * 2000, INF);
  cin >> N >> M >> L;
  --L;
  for(int i = 0; i < N; i++) v[i][i] = 0;
  vector< pair< int, int > > ex;
  for(int i = 0; i < N; i++) {
    int p;
    cin >> p;
    if(p > 0) ex.emplace_back(i, p);
  }
  for(int i = 0; i < M; i++) {
    int a, b, c;
    cin >> a >> b >> c;
    --a, --b;
    v[a][b] = c;
    v[b][a] = c;
  }
  for(int k = 0; k < N; k++) {
    for(int i = 0; i < N; i++) {
      for(int j = 0; j < N; j++) {
        v[i][j] = min(v[i][j], v[i][k] + v[k][j]);
      }
    }
  }
  int64 ret = INF;
  for(int i = 0; i < N; i++) {
    int64 cost = 0, pv = 0;
    bool exist = false;
    for(auto e : ex) {
      if(e.first == L) exist = true;
      cost += v[i][e.first] * 2 * e.second;
    }
    if(exist) {
      cost -= v[i][L];
    } else {
      for(auto e : ex) {
        pv = max(pv, v[i][e.first] - v[L][e.first]);
      }
    }

    ret = min(ret, cost - pv);
  }
  cout << ret << endl;
}