#include <cstdio>
#include <algorithm>
using namespace std;

class range {private: struct I{int x;int operator*(){return x;}bool operator!=(I& lhs){return x<lhs.x;}void operator++(){++x;}};I i,n;
public:range(int n):i({0}),n({n}){}range(int i,int n):i({i}),n({n}){}I& begin(){return i;}I& end(){return n;}};

const int inf = 987654321;

int main(void) {
  int n, m;
  scanf("%d", &n);
  vector<int> s(n);
  for(int i : range(n)) { scanf("%d", &s[i]); }
  scanf("%d", &m);
  vector<vector<int>> graph(n, vector<int>(n));
  for(int i : range(n)) {
    for(int j : range(n)) {
      graph[i][j] = i==j ? 0 : inf;
    }
  }
  for(int i : range(m)) {
    int a, b, c;  scanf("%d%d%d", &a, &b, &c);
    graph[a][b] = c;
    graph[b][a] = c;
  }
  for(int k : range(n)) {
    for(int i : range(n)) {
      for(int j : range(n)) {
        graph[i][j] = min(graph[i][j], graph[i][k] + graph[k][j]);
      }
    }
  }
  int res = inf;
  for(int i : range(1, n-1)) {
    for(int j : range(1, n-1)) {
      if(i==j) { continue; }
      res = min(res, graph[0][i] + graph[i][j] + graph[j][n-1] + s[i] + s[j]);
    }
  }
  printf("%d\n", res);
  return 0;
}