#include<bits/stdc++.h>
using namespace std;
#define ALL(x) x.begin(),x.end()
#define rep(i,n) for(int i=0;i<(n);i++)
#define debug(v) cout<<#v<<":";for(auto x:v){cout<<x<<' ';}cout<<endl;
#define INF 1000000000
#define mod 1000000007
using ll=long long;
const ll LINF=1001002003004005006ll;
int dx[]={1,0,-1,0};
int dy[]={0,1,0,-1};
// ll gcd(ll a,ll b){return b?gcd(b,a%b):a;}
template<class T>bool chmax(T &a,const T &b){if(a<b){a=b;return true;}return false;}
template<class T>bool chmin(T &a,const T &b){if(b<a){a=b;return true;}return false;}

template<typename T>
vector<T> dijkstra(int s,vector<vector<pair<int,T>>> &G){
    const T TINF=numeric_limits<T>::max();
    using P=pair<T,int>;
    int n=G.size();
    vector<T> d(n,TINF);
    vector<int> b(n,-1);//previous point
    priority_queue<P,vector<P>,greater<P>> q;
    d[s]=0;
    q.emplace(d[s],s);
    while(!q.empty()){
        P p=q.top();q.pop();
        int v=p.second;
        if(d[v]<p.first) continue;
        for(auto& e:G[v]){
            int u=e.first;
            T c=e.second;
            if(d[u]>d[v]+c){
                d[u]=d[v]+c;
                b[u]=v;
                q.emplace(d[u],u);
            }
        }
    }
    return d;
}

signed main(){
    cin.tie(0);
    ios::sync_with_stdio(0);
    
    int n,m,l;cin>>n>>m>>l;l--;
    vector<ll> t(n);
    int cnt=0;
    rep(i,n){
        cin>>t[i];
        cnt+=(t[i]>0);
    }
    if(cnt<=1){
        cout<<0<<endl;
        return 0;
    }

    vector<vector<pair<int,ll>>> g(n);
    rep(i,m){
        int u,v;ll c;cin>>u>>v>>c;u--,v--;
        g[u].push_back({v,c});
        g[v].push_back({u,c});
    }

    auto ldis=dijkstra(l,g);

    ll ans=LINF;
    // iに集める．jを拾ってレッカーが行く
    rep(i,n){
        auto dis=dijkstra(i,g);
        ll cost=0;
        rep(j,n) cost+=2*t[j]*dis[j];
        chmin(ans,cost+ldis[i]);
        rep(j,n)if(t[j])chmin(ans,cost-dis[j]+ldis[j]);
    }
    cout<<ans<<endl;
    return 0;
}