use std::cmp::min;
use std::io::Read;
const INF: u32 = 10000000;

fn main() {
    let mut s: String = String::new();
    std::io::stdin().read_to_string(&mut s).ok();
    let mut itr = s.trim().split_whitespace();
    let n: usize = itr.next().unwrap().parse().unwrap();
    let s: Vec<u32> = (0..n)
        .map(|_| itr.next().unwrap().parse().unwrap())
        .collect();
    let m: usize = itr.next().unwrap().parse().unwrap();
    let mut graph: Vec<Vec<(usize, u32)>> = vec![Vec::new(); n];
    for _ in 0..m {
        let a: usize = itr.next().unwrap().parse().unwrap();
        let b: usize = itr.next().unwrap().parse().unwrap();
        let c: u32 = itr.next().unwrap().parse().unwrap();
        graph[a].push((b, c));
        graph[b].push((a, c));
    }

    let mut ans: u32 = INF;
    // どの２地点に止まるか。
    for i in 1..n - 1 {
        for j in 1..n - 1 {
            if i == j {
                continue;
            }
            let mut tmp: u32 = s[i] + s[j];

            let mut q = std::collections::VecDeque::new();
            let mut dist = vec![INF; n];
            let mut used = vec![false; n];
            dist[0] = 0;
            used[0] = true;
            q.push_back(0);
            while let Some(v) = q.pop_front() {
                for &(nv, nc) in graph[v].iter() {
                    dist[nv] = min(dist[nv], dist[v] + nc);
                    if !used[nv] {
                        q.push_back(nv);
                        used[nv] = true;
                    }
                }
            }
            tmp += dist[i];

            let mut dist = vec![INF; n];
            let mut used = vec![false; n];
            dist[i] = 0;
            used[i] = true;
            q.push_back(i);
            while let Some(v) = q.pop_front() {
                for &(nv, nc) in graph[v].iter() {
                    dist[nv] = min(dist[nv], dist[v] + nc);
                    if !used[nv] {
                        q.push_back(nv);
                        used[nv] = true;
                    }
                }
            }
            tmp += dist[j];

            let mut dist = vec![INF; n];
            let mut used = vec![false; n];
            dist[j] = 0;
            used[j] = true;
            q.push_back(j);
            while let Some(v) = q.pop_front() {
                for &(nv, nc) in graph[v].iter() {
                    dist[nv] = min(dist[nv], dist[v] + nc);
                    if !used[nv] {
                        q.push_back(nv);
                        used[nv] = true;
                    }
                }
            }
            tmp += dist[n - 1];
            ans = min(ans, tmp);
        }
    }
    println!("{}", ans);
}