import std.conv, std.functional, std.stdio, std.string;
import std.algorithm, std.array, std.bigint, std.container, std.math, std.numeric, std.range, std.regex, std.typecons;
import core.bitop;

class EOFException : Throwable { this() { super("EOF"); } }
string[] tokens;
string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; }
int readInt() { return readToken.to!int; }
long readLong() { return readToken.to!long; }
real readReal() { return readToken.to!real; }

bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } }
bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } }

int binarySearch(alias pred, T)(in T[] as) { int lo = -1, hi = cast(int)(as.length); for (; lo + 1 < hi; ) { const mid = (lo + hi) >> 1; (unaryFun!pred(as[mid]) ? hi : lo) = mid; } return hi; }
int lowerBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a >= val)); }
int upperBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a > val)); }


enum INF = 10L^^18;

int N, M, L;
long[] T;
int[] A, B;
long[] C;

int[][] G;

long[] distFrom(int src) {
  alias Node = Tuple!(long, int);
  auto q = BinaryHeap!(Array!Node)();
  auto d = new long[N];
  d[] = INF;
  d[src] = 0;
  q.insert(Node(0, src));
  for (; !q.empty; ) {
    const c = q.front[0];
    const u = q.front[1];
    q.removeFront;
    if (d[u] == c) {
      foreach (i; G[u]) {
        const v = A[i] ^ B[i] ^ u;
        const cc = c + C[i];
        if (d[v] > cc) {
          d[v] = cc;
          q.insert(Node(cc, v));
        }
      }
    }
  }
  return d;
}

void main() {
  try {
    for (; ; ) {
      N = readInt();
      M = readInt();
      L = readInt() - 1;
      T = new long[N];
      foreach (u; 0 .. N) {
        T[u] = readLong();
      }
      A = new int[M];
      B = new int[M];
      C = new long[M];
      foreach (i; 0 .. M) {
        A[i] = readInt() - 1;
        B[i] = readInt() - 1;
        C[i] = readLong();
      }
      
      G = new int[][N];
      foreach (i; 0 .. M) {
        G[A[i]] ~= i;
        G[B[i]] ~= i;
      }
      
      const d0 = distFrom(L);
      
      long ans = INF;
      foreach (s; 0 .. N) {
        const d1 = distFrom(s);
        long cost;
        foreach (u; 0 .. N) {
          cost += 2 * d1[u] * T[u];
        }
        long lost = INF;
        foreach (u; 0 .. N) {
          if (T[u] > 0) {
            chmin(lost, d0[u] - d1[u]);
          }
        }
        cost += lost;
        debug {
          writefln("s = %s: cost = %s", s, cost);
        }
        chmin(ans, cost);
      }
      writeln(ans);
    }
  } catch (EOFException e) {
  }
}