import sys
input = sys.stdin.buffer.readline
sys.setrecursionlimit(10 ** 7)
inf = 10**18

N = int(input())
S = [int(input()) for _ in range(N)]
M = int(input())
G = [[inf]*N for _ in range(N)]
for _ in range(M):
    a, b, c = map(int, input().split())
    G[a][b] = c
    G[b][a] = c

for k in range(N):
    for i in range(N):
        for j in range(N):
            G[i][j] = min(G[i][j], G[i][k] + G[k][j])

ans = inf
for a in range(1, N - 1):
    for b in range(1, N - 1):
        if a == b:
            continue
        cost = G[0][a] + S[a] + G[a][b] + S[b] + G[b][N-1]
        ans = min(ans, cost)
print(ans)