package main

import (
	"bufio"
	"fmt"
	"os"
	"strconv"
)

var INF int = 10000*50*1000 + 1

func main() {
	N := nextInt()
	S := make([]int, N)
	for i := 0; i < N; i++ {
		S[i] = nextInt()
	}
	M := nextInt()
	d := makeDoubleSliceInt(N, N)
	for i := 0; i < M; i++ {
		A := nextInt()
		B := nextInt()
		C := nextInt()
		d[A][B] = C
		d[B][A] = C
	}
	for k := 0; k < N; k++ {
		for i := 0; i < N; i++ {
			for j := 0; j < N; j++ {
				d[i][j] = min(d[i][j], d[i][k]+d[k][j])
			}

		}
	}
	ans := INF
	for i := 1; i < N-1; i++ {
		for j := 1; j < N-1; j++ {
			if i == j {
				continue
			}
			ans = min(ans, d[0][i]+d[i][j]+d[j][N-1]+S[i]+S[j])
		}
	}
	fmt.Println(ans)
	//fmt.Println(d)
	//fmt.Println(S)
}

func min(a, b int) int {
	if a < b {
		a, b = b, a
	}
	return b
}

var s = bufio.NewScanner(os.Stdin)

func next() string {
	s.Split(bufio.ScanWords)
	s.Scan()
	return s.Text()
}

func nextInt() int {
	i, e := strconv.Atoi(next())
	if e != nil {
		panic(e)
	}
	return i
}

func makeDoubleSliceInt(y, x int) [][]int {
	ss := make([][]int, y)
	for i := range ss {
		ss[i] = make([]int, x)
		for j := 0; j < x; j++ {
			if i == j {
				ss[i][j] = 0
			} else {
				ss[i][j] = INF

			}
		}
	}
	return ss
}