#include <bits/stdc++.h>
#include <atcoder/all>
using namespace atcoder;
using namespace std;
using ll=long long;
using ld=long double;
ld pie=3.141592653589793;
ll mod=1000000007;
ll inf=10099999999999990;
int main(){
    ll n,m,l;
    cin >> n >> m >> l;
    l--;
    vector<ll>t(n);
    for (ll i = 0; i < n; i++)
    {
        cin >> t[i];
    }
    vector<vector<pair<ll,ll>>>g(n);
    for (ll i = 0; i < m; i++)
    {
        ll a,b,c;
        cin >> a >> b >> c;
        a--,b--;
        g[a].push_back({b,c});
        g[b].push_back({a,c});
    }
    ll ans=inf;
    vector<ll>mm;
    vector<ll>memo(n,inf);
    memo[l]=0;
    priority_queue<pair<ll,ll>,vector<pair<ll,ll>>,greater<pair<ll,ll>>>pq;
    pq.push({0,l});
    while (!pq.empty())
    {
        ll v=pq.top().second;
        ll x=pq.top().first;
        pq.pop();
        if (x!=memo[v])
        {
            continue;
        }
            
        for (ll j = 0; j < g[v].size(); j++)
        {
            if (memo[g[v][j].first]>memo[v]+g[v][j].second)
            {
                if (1)
                {
                    pq.push({memo[v]+g[v][j].second,g[v][j].first});
                }
                memo[g[v][j].first]=memo[v]+g[v][j].second;
            }
        }
    }
    mm=memo;
    for (ll i = 0; i < n; i++)
    {
        vector<ll>memo(n,inf);
        memo[i]=0;
        priority_queue<pair<ll,ll>,vector<pair<ll,ll>>,greater<pair<ll,ll>>>pq;
        pq.push({0,i});
        while (!pq.empty())
        {
            ll v=pq.top().second;
            ll x=pq.top().first;
            pq.pop();
            if (x!=memo[v])
            {
                continue;
            }
            
            for (ll j = 0; j < g[v].size(); j++)
            {
                if (memo[g[v][j].first]>memo[v]+g[v][j].second)
                {
                    if (1)
                    {
                        pq.push({memo[v]+g[v][j].second,g[v][j].first});
                    }
                    memo[g[v][j].first]=memo[v]+g[v][j].second;
                }
            }
        }
        ll x=0;
        ll z=0;
        for (ll j = 0; j < n; j++)
        {
            x+=memo[j]*t[j]*2;
            if (t[j]>=1)
            {
                z=max(z,memo[j]-mm[j]);
            }
        }
        x-=z;
        ans=min(ans,x);
    }
    cout << ans << endl;
}