# coding: utf-8
import array, bisect, collections, copy, heapq, itertools, math, random, re, string, sys, time

sys.setrecursionlimit(10 ** 7)
INF = 10 ** 20
MOD = 10 ** 9 + 7


def II(): return int(input())
def ILI(): return list(map(int, input().split()))
def IAI(LINE): return [ILI() for __ in range(LINE)]
def IDI(): return {key: value for key, value in ILI()}


def read():
    N = II()
    S = [II() for __ in range(N)]
    M = II()
    A, B, C = list(), list(), list()
    for __ in range(M):
        a, b, c = ILI()
        A.append(a)
        B.append(b)
        C.append(c)
    return (N, S, M, A, B, C)


def solve(N, S, M, A, B, C):
    edge = [[INF] * N for __ in range(N)]
    for a, b, c in zip(A, B, C):
        edge[a][b] = c
        edge[b][a] = c
    for i in range(N):
        edge[i][i] = 0
    for i in range(N):
        for j in range(N):
            for k in range(N):
                edge[i][j] = min(edge[i][j], edge[i][k] + edge[k][j])

    ans = INF

    for a, b in itertools.combinations(range(1, N - 1), 2):
        cost_1 = S[a] + S[b] + edge[0][a] + edge[a][b] + edge[b][N - 1]
        cost_2 = S[a] + S[b] + edge[0][b] + edge[b][a] + edge[a][N - 1]
        ans = min(ans, cost_1, cost_2)

    return ans


def main():
    params = read()
    print(solve(*params))


if __name__ == "__main__":
    main()