use std::{collections::BinaryHeap, cmp::Reverse};

const INF: usize = 1usize << 60;

fn dijkstra(start: usize, paths: &Vec<Vec<(usize, usize)>>) -> Vec<usize> {
    let n = paths.len();
    let mut que = BinaryHeap::new();
    que.push((Reverse(0), start));
    let mut costs = vec![INF; n];
    costs[start] = 0;
    while let Some((Reverse(cost), u)) = que.pop() {
        if cost > costs[u] { continue; }
        for &(v, w) in paths[u].iter() {
            if costs[u] + w < costs[v] {
                costs[v] = costs[u] + w;
                que.push((Reverse(costs[v]), v));
            }
        }
    }
    costs
}

fn main() {
    let mut nml = String::new();
    std::io::stdin().read_line(&mut nml).ok();
    let nml: Vec<usize> = nml.trim().split_whitespace().map(|s| s.parse().unwrap()).collect();
    let n = nml[0];
    let m = nml[1];
    let l = nml[2]-1;
    let mut t = String::new();
    std::io::stdin().read_line(&mut t).ok();
    let t: Vec<usize> = t.trim().split_whitespace().map(|s| s.parse().unwrap()).collect();
    let mut paths = vec![vec![]; n];
    for _ in 0..m {
        let mut temp = String::new();
        std::io::stdin().read_line(&mut temp).ok();
        let temp: Vec<usize> = temp.trim().split_whitespace().map(|s| s.parse().unwrap()).collect();
        let u = temp[0]-1;
        let v = temp[1]-1;
        let c = temp[2];
        paths[u].push((v, c));
        paths[v].push((u, c));
    }

    if t.iter().filter(|&&v| v > 0).count() == 1 {
        println!("0");
        return;
    }
    let mut dists = Vec::with_capacity(n);
    for i in 0..n {
        dists.push(dijkstra(i, &paths));
    }
    let mut result = INF;
    for i in 0..n {
        let total = (0..n).map(|j| dists[i][j] * 2 * t[j]).sum::<usize>();
        let first_action = (0..n).filter(|&j| t[j] > 0).map(|j| 2*dists[i][j] + dists[i][l] - dists[l][j] - dists[j][i]).max().unwrap();
        result = result.min(total + dists[l][i] - first_action);
    }
    println!("{}", result);
}