from collections import *
from itertools import *
from functools import *
from heapq import *
import sys,math
input = sys.stdin.readline


N = int(input())
S = [int(input()) for _ in range(N)]
M = int(input())
INF = (1<<50)
dist = [[INF]*N for _ in range(N)]
for _ in range(M):
    a,b,c = map(int,input().split())
    dist[a][b]=c
    dist[b][a]=c
for i in range(N):
    dist[i][i] = 0
for k in range(N):
    for i in range(N):
        for j in range(N):
            dist[i][j] = min(dist[i][j],dist[i][k] + dist[k][j])
ans = INF    
for i in range(1,N-1):
    for j in range(1,N-1):
        if i==j:
            continue
        
        tmp = dist[0][i] + dist[i][j] + dist[j][N-1] + S[i]+S[j]
        ans = min(ans,tmp)
print(ans)