N = int(raw_input())
S = [int(raw_input()) for i in range(N)]
M = int(raw_input())
cost = [[10000007 for i in range(N)] for j in range(N)]
for i in range(N):
	cost[i][i] = 0
for i in range(M):
	a,b,c = map(int,raw_input().split())
	cost[a][b] = min(cost[a][b],c)
	cost[b][a] = cost[a][b]
for i in range(N):
	for j in range(N):
		for k in range(N):
			cost[j][k] = min(cost[j][k],cost[j][i] + cost[i][k])
ans = 10000007
for i in range(1,N - 1):
	for j in range(1,N - 1):
		if i == j:continue
		ans = min(ans,cost[0][i] + cost[i][j] + cost[j][N - 1] + S[i] + S[j])
print ans