import sys
input = sys.stdin.readline

N = int(input())
S = [int(input()) for _ in range(N)]
M = int(input())
G = [[] for _ in range(N)]
INF = 10**18
dist = [[INF] * N for _ in range(N)]
for i in range(N):
    dist[i][i] = 0
for _ in range(M):
    A, B, C = map(int, input().split())
    dist[A][B] = dist[B][A] = C
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
        ans = min(ans, dist[0][i] + S[i] + dist[i][j] + S[j] + dist[j][N - 1])
print(ans)