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

M = int(input())
INF = 1 << 60
dist = [[INF] * N for i in range(N)]
for i in range(N):
    dist[i][i] = 0
    
for i in range(M):
    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])
            
ans = INF
for i in range(1, N - 1):
    for j in range(1, N - 1):
        if i == j:
            continue
        val = dist[0][i] + S[i] + dist[i][j] + S[j] + dist[j][N - 1]
        ans = min(ans, val)
        
print(ans)