#include <iostream>
#include <algorithm>

#define INF (1 << 25)

using namespace std;

int main()
{
  int n;
  int s[50];
  
  cin >> n;
  for(int i = 0; i < n; i++){
    cin >> s[i];
  }
  
  int m;
  int d[50][50];

  for(int i = 0; i < n; i++){
    for(int j = 0; j < n; j++){
      if(i == j) d[i][j] = 0;
      else d[i][j] = INF;
    }
  }

  cin >> m;
  for(int i = 0; i < m; i++){
    int a, b, c;
    cin >> a >> b >> c;
    d[a][b] = d[b][a] = c;
  }
  
  for(int i = 0; i < n; i++){
    for(int j = 0; j < n; j++){
      for(int k = 0; k < n; k++){
	d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
      }
    }
  }
  
  int ans = INF;
  
  for(int i = 1; i < n-1; i++){
    for(int j = 1; j < n-1; j++){
      if(i == j) continue;
      ans = min(ans, d[0][i] + s[i] + d[i][j] + s[j] + d[j][n-1]);
    }
  }
  
  cout << ans << endl;

}