n = int(input())
s = [int(input()) for _ in range(n)]
INF = 10**18
dist = [[INF] * n for _ in range(n)]
for _ in range(int(input())):
    a, b, c = map(int, input().split())
    dist[a][b] = c
    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])

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