n = int(input())
s = [int(input()) for _ in range(n)]
m = int(input())
abc = [[9999 for _ in range(n)] for _ in range(n)]
for i in range(n):
    abc[i][i] = 0

for _ in range(m):
    a, b, c = map(int, input().split())
    abc[a][b] = c
    abc[b][a] = c

for k in range(n):
    for i in range(n):
        for j in range(n):
            abc[i][j] = min(abc[i][j], abc[i][k] + abc[k][j])

ans = 1e9
for i in range(1, n - 1):
    for j in range(1, n - 1):
        if i == j:
            continue
        ans = min(ans, abc[0][i] + abc[i][j] + abc[j][n - 1] + s[i] + s[j])

print(ans)