import sys
import io, os
input = io.BytesIO(os.read(0,os.fstat(0).st_size)).readline

n = int(input())
S = [int(input()) for i in range(n)]
m = int(input())
INF = 10**18
D = [[INF]*n for i in range(n)]
for i in range(n):
    D[i][i] = 0
for i in range(m):
    a, b, c = map(int, input().split())
    D[a][b] = c
    D[b][a] = c

def warshal_floyd(d):
    n = len(d)
    for k in range(n):
        for i in range(n):
            for j in range(n):
                d[i][j] = min(d[i][j], d[i][k]+d[k][j])
    return d

D = warshal_floyd(D)
ans = INF
for i in range(1, n-1):
    for j in range(1, n-1):
        if i == j:
            continue
        temp = D[0][i]+S[i]+D[i][j]+S[j]+D[j][n-1]
        ans = min(ans, temp)
print(ans)