#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> pll;
int main(){
    ll inf=1000000000000000000;
    ll n,m,l;cin>>n>>m>>l;
    l--;
    ll t[n];for(ll i=0;i<n;i++)cin>>t[i];
    vector<ll> v[n];
    ll cost[n][n];
    for(ll i=0;i<m;i++){
        ll a,b,c;cin>>a>>b>>c;
        a--;b--;
        v[a].push_back(b);
        v[b].push_back(a);
        cost[a][b]=c;
        cost[b][a]=c;
    }
  for(ll i=0;i<n;i++)cost[i][i]=0;
    ll d[n][n];
    for(ll i=0;i<n;i++)fill(d[i],d[i]+n,inf);
    for(ll i=0;i<n;i++){
      priority_queue<pll,vector<pll>,greater<pll> >q;
      q.push(make_pair((ll)0,i));
      d[i][i]=0;
      bool used[n];fill(used,used+n,false);
      while(q.size()>0){
          pll p=q.top();q.pop();
          ll pf=p.first,ps=p.second;
        //cout<<ps<<endl;
          if(used[ps])continue;
          used[ps]=true;
          for(ll j=0;j<v[ps].size();j++){
              ll now=v[ps][j];
              if(used[now])continue;
              if(d[i][now]>pf+cost[ps][now]){
                  d[i][now]=pf+cost[ps][now];
                  q.push(make_pair(d[i][now],now));
              }
          }
      }
    }
  
    ll ans=inf;
    for(ll i=0;i<n;i++){
        if(i==l){
            ll sum=0;
            for(ll j=0;j<n;j++)sum+=t[j]*2*d[i][j];
            ans=min(ans,sum);
          //cout<<sum<<endl;
            continue;
        }
        ll sum=0;
        ll num;
        ll mi=inf;
        for(ll j=0;j<n;j++){
            if(i==j)continue;
            ll ss=d[l][j]-d[j][i];
            if(t[j]==0)ss=d[l][j]+d[j][i];
            if(ss<mi){
                mi=ss;
                num=j;
            }
        }
        sum=d[l][num]+d[num][i];
      //cout<<sum<<" ";
        for(ll j=0;j<n;j++){
            if(j==num)sum+=(max((ll)0,t[j]-1))*2*d[i][j];
            else sum+=t[j]*2*d[i][j];
        }
        ans=min(ans,sum);
      //cout<<sum<<endl;
    }
    cout<<ans<<endl;
}