#include <bits/stdc++.h>

using namespace std;
typedef long long ll;
typedef pair<ll, ll> p_ll;

template<class T>
void debug(T itr1, T itr2) { auto now = itr1; while(now<itr2) { cout << *now << " "; now++; } cout << endl; }
#define repr(i,from,to) for (ll i=(ll)from; i<(ll)to; i++)
#define all(vec) vec.begin(), vec.end()
#define rep(i,N) repr(i,0,N)
#define per(i,N) for (int i=(int)N-1; i>=0; i--)

const ll MOD = pow(10,9)+7;
const ll LLINF = pow(2,61)-1;
const int INF = pow(2,30)-1;

vector<ll> fac;
void c_fac(int x=pow(10,6)+10) { fac.resize(x,true); rep(i,x) fac[i] = i ? (fac[i-1]*i)%MOD : 1; }
ll inv(ll a, ll m=MOD) { ll b = m, x = 1, y = 0; while (b!=0) { int d = a/b; a -= b*d; swap(a,b); x -= y*d; swap(x,y); } return (x+m)%m; }
ll nck(ll n, ll k) { return fac[n]*inv(fac[k]*fac[n-k]%MOD)%MOD; }
ll gcd(ll a, ll b) { if (a<b) swap(a,b); return b==0 ? a : gcd(b, a%b); }
ll lcm(ll a, ll b) { return a/gcd(a,b)*b; }

// ----------------------------------------------------------------------
// ----------------------------------------------------------------------

struct edge { ll to, d; };
vector<vector<edge>> adj;

vector<ll> dijkstra(int n=0) {
  int N = adj.size();
  auto c = [](const p_ll &x, const p_ll &y){return x.second>y.second;};
  priority_queue<p_ll, vector<p_ll>, decltype(c)> q(c);
  vector<ll> result(N,LLINF); result[n] = 0; q.push(make_pair(n,0));
  while(q.size()) {
    p_ll now = q.top(); q.pop();
    ll np = now.first, nd = now.second;
    if (nd>result[np]) continue;
    for (auto x: adj[np]) {
      if (result[x.to]<=result[np]+x.d) continue;
      q.push(make_pair(x.to, result[np]+x.d));
      result[x.to] = result[np]+x.d;
    }
  }
  return result;
}

// ----------------------------------------------------------------------
// ----------------------------------------------------------------------


int main() {
  ll N, M, L; cin >> N >> M >> L; L--;
  ll t[N]; rep(i,N) cin >> t[i];
  adj.resize(N);
  rep(i,M) {
    ll a, b, c; cin >> a >> b >> c; a--; b--;
    adj[a].push_back({b,c});
    adj[b].push_back({a,c});
  }
  vector<vector<ll>> d(N); rep(i,N) d[i] = dijkstra(i);
  // rep(i,N) debug(all(d[i]));

  ll result = LLINF;
  rep(i,N) {
    ll tr = 0;
    rep(j,N) tr += d[i][j] * 2 * t[j];
    ll mi = d[L][i]; rep(j,N) if (t[j]) mi = min(mi, d[L][j]-d[j][i]);
    tr += mi;
    result = min(result, tr);
    // cout << i << "->" << tr << " - " << mi << endl;
  }
  cout << result << endl;
  return 0;
}