#include <bits/stdc++.h>
using namespace std;

#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define repi(i,a,b) for(int i=(int)(a);i<(int)(b);i++)
#define all(x) (x).begin(),(x).end()
#define foreach(u,v) for(auto (u) : (v))
#define pb push_back
#define mp make_pair
#define mt make_tuple

#define int long long

typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<ll, ll> pll;
typedef vector<ll> vl;

const int inf = 1e9;
const ll linf = 1LL<<60;
const ll mod = 1e9 + 7;
const double eps = 1e-9;

/*
*/

int n, m, l, t[2000];
vector<pii> es[2000];
ll d[2000][2000];

void dijkstra(int s)
{
  priority_queue<pll, vector<pll>, greater<pll>> que;
  fill(d[s], d[s]+n, linf);
  d[s][s] = 0;
  que.push(mp(0LL, s));

  while(!que.empty()){
    pll p = que.top();
    que.pop();
    if(d[s][p.second] < p.first) continue;
    foreach(e, es[p.second]){
      if(d[s][e.first] > d[s][p.second] + e.second){
        d[s][e.first] = d[s][p.second] + e.second;
        que.push(mp(d[s][e.first], e.first));
      }
    }
  }
}

signed main()
{
  cin >> n >> m >> l;
  rep(i, n){
    cin >> t[i];
  }
  l--;

  rep(i, m){
    int a, b, c;
    cin >> a >> b >> c;
    a--; b--;
    es[a].pb(mp(b, c));
    es[b].pb(mp(a, c));
  }

  rep(i, n){
    dijkstra(i);
  }

  ll ans = linf;
  rep(i, n){
    ll tmp = 0, lmin = d[l][i], x;
    rep(j, n){
      tmp += 2*t[j]*d[i][j];
      if(t[j] > 0)
        if(lmin > d[l][j]){
          lmin = d[l][j];
          x = j;
        }
        //lmin = min(lmin, d[l][j]);
    }
    ans = min(ans, tmp+lmin-d[i][x]);
  }

  cout << ans << endl;

  return 0;
}