#include <vector>
#include <queue>
#include <deque>
#include <stack>
#include <map>
#include <set>
#include <algorithm>
#include <functional>
#include <iostream>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <ctime>
#include <cctype>
#include <string>
#include <cstring>

using namespace std;

typedef long long ll;


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

  int m;
  cin >> m;
  int graph[n][n];
  memset(graph, 0, sizeof(graph));
  for (int i = 0; i < m; i++) {
    int a, b, c;
    cin >> a >> b >> c;
    graph[a][b] = c;
    graph[b][a] = c;
  }

  int d[n][n];
  memcpy(d, graph, sizeof(graph));
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < n; j++) {
      if (graph[i][j] == 0) d[i][j] = 1e9;
    }
  }
  
  for (int k = 0; k < n; k++) {
    for (int i = 0; i < n; i++) {
      for (int j = 0; j < n; j++) d[i][j] = min(d[i][j], d[i][k]+d[k][j]);
    }
  }

  // for (int i = 0; i < n; i++) {
  //   for (int j = 0; j < n; j++) {
  //     cout << d[i][j] << " ";
  //   }
  //   cout << endl;
  // }
  
  int ans = 1e9;
  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]+d[i][j]+d[j][n-1]+s[i]+s[j]);
    }
  }

  cout << ans << endl;
}