import java.io.*; import java.util.*; import java.util.Map.Entry; @SuppressWarnings("unused") public class Main { //final boolean isDebug = true; final boolean isDebug = false; String fileName = "input.txt"; FastScanner sc; PrintWriter out; final int MOD = (int)1e9+7; //final int INF = Integer.MAX_VALUE / 2; final long INF = Long.MAX_VALUE / 2; void solve() throws Exception{ int N = sc.nextInt(), M = sc.nextInt(), L = sc.nextInt()-1; int[] num = new int[N]; for(int i = 0; i < N; i++) num[i] = sc.nextInt(); ArrayList> G = new ArrayList<>(); for(int i = 0; i < N; i++) G.add(new ArrayList<>()); for(int i = 0; i < M; i++){ int a = sc.nextInt()-1, b = sc.nextInt()-1; int c = sc.nextInt(); G.get(a).add(new Edge(a, b, c)); G.get(b).add(new Edge(b, a, c)); } long[] distL = dijkstra(G, L); long min = Long.MAX_VALUE / 2; for(int i = 0; i < N; i++){ long[] dist = dijkstra(G, i); int K = -1; long d = 0; for(int j = 0; j < N; j++){ if(num[j] != 0 && d < dist[j] - distL[j]){ K = j; d = dist[j] - distL[j]; } } long sum = 0; if(K != -1){ for(int j = 0; j < N; j++){ if(j == K){ sum += distL[K] + dist[K]; sum += dist[K] * 2 * (num[K] - 1); }else if(num[j] >= 1){ sum += dist[j] * 2 * num[j]; } } }else{ sum += dist[L]; for(int j = 0; j < N; j++){ sum += dist[j] * 2 * num[j]; } } min = Math.min(min, sum); } System.out.println(min); } long[] dijkstra(ArrayList> G, int start){ long INF = Long.MAX_VALUE / 2; long[] dist = new long[G.size()]; Arrays.fill(dist, INF); dist[start] = 0; PriorityQueue priorityQueue = new PriorityQueue(); priorityQueue.add(new Node(start, 0)); while(!priorityQueue.isEmpty()){ Node node = priorityQueue.poll(); if(dist[node.index] < node.cost) continue; for(Edge e : G.get(node.index)){ if(dist[e.to] > dist[node.index] + e.cost){ dist[e.to] = dist[node.index] + e.cost; priorityQueue.add(new Node(e.to, dist[e.to])); } } } return dist; } /* end solve */ /* main */ public static void main(String[] args) throws Exception { new Main().m(); } void m() throws Exception { long S = System.currentTimeMillis(); sc = (isDebug) ? new FastScanner(new FileInputStream(fileName)) : new FastScanner(System.in); out = new PrintWriter(System.out); solve(); out.flush(); long G = System.currentTimeMillis(); if(isDebug){ System.out.println("---Debug---"); System.out.printf("%8d ms\n", (G-S)); } } /* end main */ } /* end Main */ class Node implements Comparable{ int index; long cost; public Node(int i, long c){ index = i; cost = c; } @Override public int compareTo(Node o) { return Long.compare(this.cost, o.cost); } } class Edge implements Comparable{ int from; int to; long cost; public Edge(int f, int t, long c){ from = f;to = t;cost = c; } @Override public int compareTo(Edge o) { return Long.compare(this.cost, o.cost); } } class FastScanner { private InputStream in; private final byte[] buffer = new byte[1024]; private int ptr = 0; private int buflen = 0; public FastScanner(InputStream in) { this.in = in; } private boolean hasNextByte() { if (ptr < buflen) { return true; }else{ ptr = 0; try { buflen = in.read(buffer); } catch (IOException e) { e.printStackTrace(); } if (buflen <= 0) { return false; } } return true; } private int readByte() { if (hasNextByte()) return buffer[ptr++]; else return -1; } private static boolean isPrintableChar(int c){ return 33 <= c && c <= 126; } public boolean hasNext() { while(hasNextByte() && !isPrintableChar(buffer[ptr])) ptr++; return hasNextByte(); } public String next() { if (!hasNext()) throw new NoSuchElementException(); StringBuilder sb = new StringBuilder(); int b = readByte(); while(isPrintableChar(b)) { sb.appendCodePoint(b); b = readByte(); } return sb.toString(); } public String nextLine() { if (!hasNext()) throw new NoSuchElementException(); StringBuilder sb = new StringBuilder(); int b = readByte(); while(b != 10) { sb.appendCodePoint(b); b = readByte(); } return sb.toString(); } public long nextLong() { if (!hasNext()) throw new NoSuchElementException(); long n = 0; boolean minus = false; int b = readByte(); if (b == '-') { minus = true; b = readByte(); } if (b < '0' || '9' < b) { throw new NumberFormatException(); } while(true){ if ('0' <= b && b <= '9') { n *= 10; n += b - '0'; }else if(b == -1 || !isPrintableChar(b)){ return minus ? -n : n; }else{ throw new NumberFormatException(); } b = readByte(); } } public int nextInt() { long nl = nextLong(); if (nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE) throw new NumberFormatException(); return (int) nl; } public double nextDouble() { return Double.parseDouble(next()); } }