// ---------- begin input macro ----------
// reference: https://qiita.com/tanakh/items/0ba42c7ca36cd29d0ac8
macro_rules! input {
    (source = $s:expr, $($r:tt)*) => {
        let mut iter = $s.split_whitespace();
        input_inner!{iter, $($r)*}
    };
    ($($r:tt)*) => {
        let s = {
            use std::io::Read;
            let mut s = String::new();
            std::io::stdin().read_to_string(&mut s).unwrap();
            s
        };
        let mut iter = s.split_whitespace();
        input_inner!{iter, $($r)*}
    };
}

macro_rules! input_inner {
    ($iter:expr) => {};
    ($iter:expr, ) => {};
    ($iter:expr, $var:ident : $t:tt $($r:tt)*) => {
        let $var = read_value!($iter, $t);
        input_inner!{$iter $($r)*}
    };
}

macro_rules! read_value {
    ($iter:expr, ( $($t:tt),* )) => {
        ( $(read_value!($iter, $t)),* )
    };
    ($iter:expr, [ $t:tt ; $len:expr ]) => {
        (0..$len).map(|_| read_value!($iter, $t)).collect::<Vec<_>>()
    };
    ($iter:expr, chars) => {
        read_value!($iter, String).chars().collect::<Vec<char>>()
    };
    ($iter:expr, bytes) => {
        read_value!($iter, String).bytes().collect::<Vec<u8>>()
    };
    ($iter:expr, usize1) => {
        read_value!($iter, usize) - 1
    };
    ($iter:expr, $t:ty) => {
        $iter.next().unwrap().parse::<$t>().expect("Parse error")
    };
}
// ---------- end input macro ----------

fn run() {
    input! {
        n: usize,
        m: usize,
        k: u32,
        a: [u64; n],
        e: [(usize1, usize1, u64); m],
    }
    let inf = 18 * 10u64.pow(9) + 1;
    let mut g = vec![vec![inf; n]; n];
    for i in 0..n {
        g[i][i] = 0;
    }
    for (a, b, c) in e {
        g[a][b] = c;
        g[b][a] = c;
    }
    for k in 0..n {
        for i in 0..n {
            for j in 0..n {
                g[i][j] = g[i][j].min(g[i][k] + g[k][j]);
            }
        }
    }
    let mut dp = vec![inf; 1 << n];
    for (i, a) in a.iter().enumerate() {
        dp[1 << i] = *a;
    }
    for i in 1..(1 << n) {
        let v = dp[i];
        for (j, &a) in a.iter().enumerate() {
            if i >> j & 1 == 0 {
                let w = g[j].iter().enumerate().filter(|p| i >> p.0 & 1 == 1).map(|p| *p.1).min().unwrap();
                let x = i | (1 << j);
                dp[x] = dp[x].min(v + a + w);
            }
        }
    }
    let ans = dp.iter().enumerate().filter(|p| p.0.count_ones() == k).map(|p| *p.1).min().unwrap();
    println!("{}", ans);
}

fn main() {
    run();
}