N = int(input())
S = [int(input()) for _ in range(N)]
M = int(input())

INF = 10 ** 18

G = [[INF] * N for _ in range(N)]

for i in range(N):
    G[i][i] = 0

for _ in range(M):
    u, v, c = map(int, input().split())
    G[u][v] = c
    G[v][u] = c


for k in range(N):
    for s in range(N):
        for e in range(N):
            G[s][e] = min(G[s][e], G[s][k] + G[k][e])

ans = INF
for i in range(1, N - 1):
    for j in range(1, N - 1):
        if i == j:
            continue
        tmp = G[0][i] + G[i][j] + G[j][N - 1] + S[i] + S[j]
        ans = min(ans, tmp)

print(ans)