/* -*- coding: utf-8 -*-
 *
 * 17.cc: No.17 2つの地点に泊まりたい - yukicoder
 */

#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<iostream>
#include<string>
#include<vector>
#include<map>
#include<set>
#include<stack>
#include<list>
#include<queue>
#include<deque>
#include<algorithm>
#include<numeric>
#include<utility>
#include<complex>
#include<functional>
 
using namespace std;

/* constant */

const int MAX_N = 50;
const int INF = 1 << 28;

/* typedef */

typedef vector<int> vi;
typedef queue<int> qi;
typedef pair<int,int> pii;

/* global variables */

int ss[MAX_N], ms[MAX_N][MAX_N];

/* subroutines */

/* main */

int main() {
  int n;
  cin >> n;

  for (int i = 0; i < n; i++) cin >> ss[i];

  int m;
  cin >> m;

  for (int i = 0; i < n; i++)
    for (int j = 0; j < n; j++)
      ms[i][j] = (i == j) ? 0 : INF;
  
  for (int i = 0; i < m; i++) {
    int ai, bi, ci;
    cin >> ai >> bi >> ci;
    ms[ai][bi] = ms[bi][ai] = ci;
  }

  for (int k = 0; k < n; k++)
    for (int i = 0; i < n; i++)
      for (int j = 0; j < n; j++) {
	int d = ms[i][k] + ms[k][j];
	if (ms[i][j] > d) ms[i][j] = d;
      }
  
  int minsum = INF;

  for (int i = 1; i < n - 1; i++)
    for (int j = 1; j < n - 1; j++)
      if (i != j) {
	int sum = ms[0][i] + ms[i][j] + ms[j][n - 1] + ss[i] + ss[j];
	if (minsum > sum) minsum = sum;
      }

  printf("%d\n", minsum);
  return 0;
}