import sys
input = sys.stdin.readline

N = int(input())
S = []
for i in range(N):
    S.append(int(input()))
    
inf = 10**18
G = [[inf] * N for i in range(N)]
for i in range(N):
    G[i][i] = 0

M = int(input())
for i 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
        ans = min(ans, G[0][a] + S[a] + G[a][b] + S[b] + G[b][N - 1] )
        
print(ans)