#include <iostream>
#include <vector>
#include <queue>
#define llint long long
#define inf 1e18

using namespace std;

typedef pair<llint, llint> P;

struct edge{
	llint to, cost;
	edge(llint a, llint b){
		to = a, cost = b;
	}
};

llint n, m, l;
llint t[2005];
vector<edge> G[2005];
llint dist[2005][2005];

void dijkstra(llint S, llint dist[])
{
	for(int i = 1; i <= n; i++) dist[i] = inf;
	dist[S] = 0;
	
	priority_queue< P, vector<P>, greater<P> > Q;
	Q.push( make_pair(0, S) );
	
	llint v, d;
	while(Q.size()){
		d = Q.top().first;
		v = Q.top().second;
		Q.pop();
		if(dist[v] < d) continue;
		for(int i = 0; i < G[v].size(); i++){
			if(dist[G[v][i].to] > d + G[v][i].cost){
				dist[G[v][i].to] = d + G[v][i].cost;
				Q.push( make_pair(dist[G[v][i].to], G[v][i].to) );
			}
		}
	}
}

int main(void)
{
	cin >> n >> m >> l;
	for(int i = 1; i <= n; i++) cin >> t[i];
	
	llint u, v, w;
	for(int i = 0; i < m; i++){
		cin >> u >> v >> w;
		G[u].push_back(edge(v, w));
		G[v].push_back(edge(u, w));
	}
	
	for(int i = 1; i <= n; i++) dijkstra(i, dist[i]);
	
	llint ans = inf;
	for(int i = 1; i <= n; i++){
		llint tmp = 0;
		for(int j = 1; j <= n; j++){
			if(t[j] == 0) continue;
			tmp = max(tmp, dist[l][i] + dist[i][j] - dist[l][j]);
		}
		tmp *= -1;
		tmp += dist[l][i];
		for(int j = 1; j <= n; j++) tmp += t[j] * dist[i][j] * 2;
		ans = min(ans, tmp);
	}
	cout << ans << endl;
	
	return 0;
}