from heapq import *
from collections import defaultdict
import sys

sys.setrecursionlimit(10 ** 6)
int1 = lambda x: int(x) - 1
p2D = lambda x: print(*x, sep="\n")
def II(): return int(sys.stdin.readline())
def MI(): return map(int, sys.stdin.readline().split())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]

def main():
    to=defaultdict(list)
    n=II()
    cost_node=[II() for _ in range(n)]
    m=II()
    for _ in range(m):
        a,b,c=MI()
        to[a].append([b,c])
        to[b].append([a,c])
    costs=[[-1]*n for _ in range(3)]
    hp0=[]
    hp1=[]
    hp2=[]
    heappush(hp0,[0,0])
    cnt=0
    while hp0 and cnt<n:
        c,u=heappop(hp0)
        if costs[0][u]!=-1:continue
        costs[0][u]=c
        cnt+=1
        for v,dc in to[u]:
            if u!=0 and u!=n-1:heappush(hp1,[c+dc+cost_node[u],v,u])
            if costs[0][v]!=-1:continue
            heappush(hp0,[c+dc,v])
    fin1=set()
    while hp1:
        c,u,fin=heappop(hp1)
        if (u,fin) in fin1:continue
        fin1.add((u,fin))
        for v,dc in to[u]:
            if u!=0 and u!=n-1 and u!=fin:
                heappush(hp2,[c+dc+cost_node[u],v])
            if (v,fin) in fin1:continue
            heappush(hp1,[c+dc,v,fin])
    while hp2:
        c,u=heappop(hp2)
        if u==n-1:
            print(c)
            exit()
        if costs[2][u]!=-1:continue
        costs[2][u]=c
        for v,dc in to[u]:
            if costs[2][v]!=-1:continue
            heappush(hp2,[c+dc,v])

main()