import java.util.*;

public class Main {
	public static void main (String[] args) {
    	Scanner sc = new Scanner(System.in);
    	int n = sc.nextInt();
    	int m = sc.nextInt();
    	int start = sc.nextInt() - 1;
    	int[] trucks = new int[n];
    	ArrayList<HashMap<Integer, Integer>> graph = new ArrayList<>();
    	for (int i = 0; i < n; i++) {
    	    trucks[i] = sc.nextInt();
    	    graph.add(new HashMap<>());
    	}
    	for (int i = 0; i < m; i++) {
    	    int a = sc.nextInt() - 1;
    	    int b = sc.nextInt() - 1;
    	    int c = sc.nextInt();
    	    graph.get(a).put(b, c);
    	    graph.get(b).put(a, c);
    	}
    	int[][] costs = new int[n][n];
    	PriorityQueue<Path> queue = new PriorityQueue<>();
    	for (int i = 0; i < n; i++) {
    	    Arrays.fill(costs[i], Integer.MAX_VALUE);
    	    queue.add(new Path(i, 0));
    	    while (queue.size() > 0) {
    	        Path p = queue.poll();
    	        if (costs[i][p.idx] <= p.value) {
    	            continue;
    	        }
    	        costs[i][p.idx] = p.value;
    	        for (int x : graph.get(p.idx).keySet()) {
    	            if (costs[i][x] != Integer.MAX_VALUE) {
    	                continue;
    	            }
    	            queue.add(new Path(x, p.value + graph.get(p.idx).get(x)));
    	        }
    	    }
    	}
    	long min = Long.MAX_VALUE;
    	for (int i = 0; i < n; i++) {
    	    int other = Integer.MAX_VALUE;
    	    long base = 0;
    	    for (int j = 0; j < n; j++) {
    	        base += costs[i][j] * (long)trucks[j] * 2;
    	        if (trucks[j] != 0) {
    	            other = Math.min(other, costs[start][j] - costs[i][j]);
    	        }
    	    }
    	    min = Math.min(min, base + other);
    	}
    	System.out.println(min);
	}
	
	static class Path implements Comparable<Path> {
	    int idx;
	    int value;
	    
	    public Path(int idx, int value) {
	        this.idx = idx;
	        this.value = value;
	    }
	    
	    public int compareTo(Path another) {
	        return value - another.value;
	    }
	}
}