#include <cstdio>
#include <cstring>
#include <cmath>
#include <climits>
#include <iostream>
#include <iomanip>
#include <list>
#include <stack>
#include <queue>
#include <vector>
#include <map>
#include <set>
#include <string>
#include <utility>
#include <algorithm>
#include <numeric>
#include <functional>

#define FOR(i,a,b) for (int i=(a);i<(b);i++)
#define RFOR(i,a,b) for (int i=(b)-1;i>=(a);i--)
#define REP(i,n) for (int i=0;i<(n);i++)
#define RREP(i,n) for (int i=(n)-1;i>=0;i--)
#define ALL(a) (a).begin(),(a).end()

using namespace std;
typedef long long ll;

const int MAX_N = 60;
const int Inf = 1 << 28;
int d[MAX_N][MAX_N];
int s[MAX_N];

int main(int argc, char *argv[])
{
  cin.tie(0);
  ios::sync_with_stdio(false);

  int N;
  cin >> N;
  REP(i,N) REP(j,N) if (i != j) d[i][j] = Inf;
  REP(i,N) cin >> s[i];
  int M;
  cin >> M;
  REP(i,M){
    int a, b, c;
    cin >> a >> b >> c;
    d[a][b] = d[b][a] = c;
  }
  REP(k,N) REP(i,N) REP(j,N) d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
  int ans = Inf;
  FOR(i,1,N-1) FOR(j,1,N-1) {
    if (i == j)
      continue;
    ans = min(ans, d[0][i] + d[i][j] + d[j][N-1] + s[i] + s[j]);
  }
  cout << ans << endl;
    
  return 0;
}