#include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <cctype>
#include <cmath>
#include <iostream>
#include <queue>
#include <list>
#include <map>
#include <numeric>
#include <set>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
#define REP(i,a,n) for(int i=(a); i<(int)(n); i++)
#define rep(i,n) REP(i,0,n)
#define FOR(it,c) for(__typeof((c).begin()) it=(c).begin(); it!=(c).end(); ++it)
#define ALLOF(c) (c).begin(), (c).end()
typedef long long ll;

int N;
int G[100][100];


int main(){
  int s, M, a, b, c;
  vector<int> S;
  cin >> N;
  rep(i,N){
    cin >> s;
    S.push_back(s);
  }
  rep(i,100) rep(j,100) G[i][j] = 100000000;

  cin >> M;
  rep(i,M){
    cin >> a >> b >> c;
    G[a][b] = c;
    G[b][a] = c;
  }
  rep(k,N) rep(i,N) rep(j,N) G[i][j] = min(G[i][j], G[i][k]+G[k][j]);

  int ret = 100000000;
  REP(i,1,N-1){
    REP(j,1,N-1){
      if(i==j) continue;
      ret = min(ret, G[0][i] + S[i] + G[i][j] + S[j] + G[j][N-1]);
    }
  }
  
  cout << ret << endl;
  
  return 0;
}