#include using namespace std; typedef long long ll; typedef pair p_ll; template void debug(T itr1, T itr2) { auto now = itr1; while(now=0; i--) const ll MOD = pow(10,9)+7; const ll LLINF = pow(2,61)-1; const int INF = pow(2,30)-1; vector fac; void c_fac(int x=pow(10,6)+10) { fac.resize(x,true); rep(i,x) fac[i] = i ? (fac[i-1]*i)%MOD : 1; } ll inv(ll a, ll m=MOD) { ll b = m, x = 1, y = 0; while (b!=0) { int d = a/b; a -= b*d; swap(a,b); x -= y*d; swap(x,y); } return (x+m)%m; } ll nck(ll n, ll k) { return fac[n]*inv(fac[k]*fac[n-k]%MOD)%MOD; } ll gcd(ll a, ll b) { if (a> adj; vector dijkstra(int n=0) { int N = adj.size(); auto c = [](const p_ll &x, const p_ll &y){return x.second>y.second;}; priority_queue, decltype(c)> q(c); vector result(N,LLINF); result[n] = 0; q.push(make_pair(n,0)); while(q.size()) { p_ll now = q.top(); q.pop(); ll np = now.first, nd = now.second; if (nd>result[np]) continue; for (auto x: adj[np]) { if (result[x.to]<=result[np]+x.d) continue; q.push(make_pair(x.to, result[np]+x.d)); result[x.to] = result[np]+x.d; } } return result; } // ---------------------------------------------------------------------- // ---------------------------------------------------------------------- int main() { ll N, M, L; cin >> N >> M >> L; L--; ll t[N]; rep(i,N) cin >> t[i]; adj.resize(N); rep(i,M) { ll a, b, c; cin >> a >> b >> c; a--; b--; adj[a].push_back({b,c}); adj[b].push_back({a,c}); } vector> d(N); rep(i,N) d[i] = dijkstra(i); // rep(i,N) debug(all(d[i])); ll result = LLINF; rep(i,N) { ll tr = 0; rep(j,N) tr += d[i][j] * 2 * t[j]; ll mi = d[L][i]; rep(j,N) if (t[j]) mi = min(mi, d[L][j]-d[j][i]); tr += mi; result = min(result, tr); // cout << i << "->" << tr << " - " << mi << endl; } ll ct = 0; rep(i,N) ct += t[i]!=0; if (ct<=1) result = 0; cout << result << endl; return 0; }