#include <bits/stdc++.h>
#define ADD(a, b) a = (a + ll(b)) % mod
#define MUL(a, b) a = (a * ll(b)) % mod
#define MAX(a, b) a = max(a, b)
#define MIN(a, b) a = min(a, b)
#define rep(i, a, b) for(int i = int(a); i < int(b); i++)
#define rer(i, a, b) for(int i = int(a) - 1; i >= int(b); i--)
#define all(a) (a).begin(), (a).end()
#define sz(v) (int)(v).size()
#define pb push_back
#define sec second
#define fst first
#define debug(fmt, ...) Debug(__LINE__, ":", fmt, ##__VA_ARGS__)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pi;
typedef pair<ll, ll> pl;
typedef pair<int, pi> ppi;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<vl> mat;
typedef complex<double> comp;
void Debug() {cout << '\n'; }
template<class FIRST, class... REST>void Debug(FIRST arg, REST... rest){
	cout<<arg<<" ";Debug(rest...);}
template<class T>ostream& operator<<(ostream& out,const vector<T>& v) {
	out<<"[";if(!v.empty()){rep(i,0,sz(v)-1)out<<v[i]<<", ";out<<v.back();}out<<"]";return out;}
template<class S, class T>ostream& operator<<(ostream& out,const pair<S, T>& v){
	out<<"("<<v.first<<", "<<v.second<<")";return out;}
const int MAX_N = 300010;
const int MAX_V = 100010;
const double eps = 1e-6;
const ll mod = 1000000007;
const int inf = 1 << 30;
const ll linf = 1LL << 60;
const double PI = 3.14159265358979323846;
///////////////////////////////////////////////////////////////////////////////////////////////////

int N, M, L;
ll ad[2010];

ll E[2010][2010];
vector<pi> G[2010]; //idx, cost
ll d[2010];
ll T[2010];

void solve() {
	cin >> N >> M >> L; L--;
	rep(i, 0, N) cin >> T[i];
	rep(i, 0, M) {
		int a, b, c; cin >> a >> b >> c; a--; b--;
		G[b].pb(pi(a, c));
		G[a].pb(pi(b, c));
	}
	rep(idx, 0, N) {
		rep(i, 0, N) d[i] = linf; d[idx] = 0;

		priority_queue<pl, vector<pl>, greater<pl>> que;
		que.push(pl(0, idx));

		while(!que.empty()) {
			pl p = que.top(); que.pop();
			int v = p.sec;
			if(d[v] < p.fst) continue; 
			rep(i, 0, sz(G[v])) {
				int n = G[v][i].fst;
				if(d[n] > d[v] + G[v][i].sec) {
					d[n] = d[v] + G[v][i].sec;
					que.push(pl(d[n], n));
				}
			}
		}
		rep(i, 0, N) {
			E[idx][i] = d[i];
			ad[idx] += d[i] * T[i] * 2;
		}
		// debug(idx, ad[idx], vl(d, d + N));
	}
	ll res = linf;
	rep(i, 0, N) {
		rep(j, 0, N) {
			if(!T[i]) continue;
			MIN(res, ad[j] + E[L][i] - E[i][j]);
		}
	}
	cout << res << "\n";
}

int main() {
#ifndef LOCAL
	ios::sync_with_stdio(false);
    cin.tie(0);
#endif
    cout << fixed;
	cout.precision(20);
	srand((unsigned int)time(NULL));
#ifdef LOCAL
	//freopen("in.txt", "wt", stdout); //for tester
    freopen("in.txt", "rt", stdin);
#endif	
	solve();
#ifdef LOCAL
    cerr << "Time elapsed: " << 1.0 * clock() / CLOCKS_PER_SEC << " s.\n";
#endif
	return 0;
}