import heapq

INF = 10 ** 15

n = int(input())
s = [int(input()) for _ in range(n)]

dist = [[INF for _ in range(n)] for _ in range(n)]
for v in range(n):
	dist[v][v] = 0

m = int(input())
for _ in range(m):
  a, b, c = map(int, input().split())
  dist[a][b] = c
  dist[b][a] = c

for k in range(n):
  for u in range(n):
  	for v in range(n):
  		if dist[u][v] > dist[u][k] + dist[k][v]:
  			dist[u][v] = dist[u][k] + dist[k][v]

src = 0
dst = n - 1

# 1 <= u < v <= n - 2
ans = INF * 10
for u in range(1, n - 2):
  for v in range(u + 1, n - 1):
    ans = min(ans,
      dist[src][u] + s[u] + dist[u][v] + s[v] + dist[v][dst],
      dist[src][v] + s[v] + dist[v][u] + s[u] + dist[u][dst]
    )

print(ans)