#include <bits/stdc++.h>

using namespace std;

#define DEBUG(x) cerr<<#x<<": "<<x<<endl;
#define DEBUG_VEC(v) cerr<<#v<<":";for(int i=0;i<v.size();i++) cerr<<" "<<v[i]; cerr<<endl
#define DEBUG_MAT(v) cerr<<#v<<endl;for(int i=0;i<v.size();i++){for(int j=0;j<v[i].size();j++) {cout<<v[i][j]<<" ";}cout<<endl;}


typedef long long ll;
#define vi vector<int>
#define vl vector<ll>
#define vii vector< vector<int> >
#define vll vector< vector<ll> >
#define vs vector<string>
#define pii pair<int,int>
#define pis pair<int,string>
#define psi pair<string,int>
#define pll pair<ll,ll>
template<class S, class T> pair<S, T> operator+(const pair<S, T> &s, const pair<S, T> &t) { return pair<S, T>(s.first + t.first, s.second + t.second); }
template<class S, class T> pair<S, T> operator-(const pair<S, T> &s, const pair<S, T> &t) { return pair<S, T>(s.first - t.first, s.second - t.second); }
template<class S, class T> ostream& operator<<(ostream& os, pair<S, T> p) { os << "(" << p.first << ", " << p.second << ")"; return os; }
#define X first
#define Y second
#define rep(i,n) for(int i=0;i<(n);i++)
#define rep1(i,n) for(int i=1;i<=(n);i++)
#define rrep(i,n) for(int i=(n)-1;i>=0;i--)
#define rrep1(i,n) for(int i=(n);i>0;i--)
#define REP(i,a,b) for(int i=a;i<b;i++)
#define in(x, a, b) (a <= x && x < b)
#define all(c) c.begin(),c.end()
template<class T> bool chmax(T &a, const T &b) { if (a<b) { a = b; return 1; } return 0; }
template<class T> bool chmin(T &a, const T &b) { if (a>b) { a = b; return 1; } return 0; }
#define UNIQUE(v) v.erase(std::unique(v.begin(), v.end()), v.end());
const ll inf = 1000000001;
const ll INF = 1e18;
const ll MOD = 1000000007;
//const ll MOD = 998244353;
const double pi = 3.14159265358979323846;
#define Sp(p) cout<<setprecision(15)<< fixed<<p<<endl;
int dx[4] = { 1,0, -1,0 }, dy[4] = { 0,1,0,-1 };
int dx2[8] = { 1,1,0,-1,-1,-1,0,1 }, dy2[8] = { 0,1,1,1,0,-1,-1,-1 };
#define fio() cin.tie(0); ios::sync_with_stdio(false);
//#define mp make_pair

int n, m, s;
vector<vector<pll>> G(2010);
vll dist(2010, vl(2010, INF));

void dijkstra(int s){
  priority_queue<pll, vector<pll>, greater<pll>> pq;
  pq.push(pll(0, s));
  dist[s][s] = 0;
  while (!pq.empty()) {
    int u = pq.top().second;
    ll d = pq.top().first;
    pq.pop();
    if (dist[s][u] < d) continue;
    rep (i, G[u].size()) {
      int v = G[u][i].first;
      ll c = G[u][i].second;
      if (dist[s][v] > d + c) {
        dist[s][v] = d + c;
        pq.push(pll(d + c, v));
      }
    }
  }
}

int main() {
  cin >> n >> m >> s;
  s--;
  vi t(n);
  int cnt = 0;
  rep (i, n) {
    cin >> t[i];
    if (t[i]) cnt++;
  }
  if (cnt == 1) {
    cout << 0 << endl;
    return 0;
  }
  rep (i, m) {
    int u, v, c;
    cin >> u >> v >> c;
    u--; v--;
    G[u].push_back(pll(v, c));
    G[v].push_back(pll(u, c));
  }
  rep (i, n) {
    dijkstra(i);
  }
  ll ans = INF;
  rep (g, n) {
    ll ma = dist[g][s];
    rep (i, n) {
      ma += 2*dist[g][i]*t[i];
    }
    chmin(ans, ma);
    rep (i, n) {
      if (t[i] == 0) continue;
      chmin(ans, ma - dist[g][s] + dist[s][i] + dist[i][g] - 2 * dist[i][g]);
    }
  }
  cout << ans << endl;
}