#!/usr/bin/env python3
# -*- coding: utf-8 -*-

n = int(input())
s = [int(input()) for j in range(n)]
m = int(input())
inf = 10**10
d = [[inf for i in range(n)] for j 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] = min(d[a][b], c)
    d[b][a] = d[a][b]

def wf(N):
    for i in range(N):#経由地点
        for j in range(N):#開始地点
            for k in range(N):#終端
                d[j][k] = min(d[j][k], d[j][i]+d[i][k])

wf(n)
ans = inf

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