#include <iostream>
#include <algorithm>
#include <cmath>
#include <vector>
#include <complex>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <iomanip>
#include <assert.h>
#include <array>
#include <cstdio>
#include <cstring>
#include <random>
#include <functional>
#include <numeric>
#include <bitset>

using namespace std;

#define REP(i,a,b) for(int i=a;i<(int)b;i++)
#define rep(i,n) REP(i,0,n)
#define all(c) (c).begin(), (c).end()
#define zero(a) memset(a, 0, sizeof a)
#define minus(a) memset(a, -1, sizeof a)
template<class T1, class T2> inline bool minimize(T1 &a, T2 b) { return b < a && (a = b, 1); }
template<class T1, class T2> inline bool maximize(T1 &a, T2 b) { return a < b && (a = b, 1); }

typedef long long ll;
int const inf = 1<<29;

int main() {

  int N; cin >> N;
  int S[N]; rep(i, N) cin >> S[i];
  int M; cin >> M;
  int dp[N][N]; rep(i, N) rep(j, N) if(i==j) dp[i][i] = 0; else dp[i][j] = inf;
  rep(i, M) {
    int a, b, c; cin >> a >> b >> c;
    dp[a][b] = dp[b][a] = c;
  }

  rep(k, N) rep(i, N) rep(j, N) {
    if(dp[i][k] == inf || dp[k][j] == inf) continue;
    if(dp[i][j] > dp[i][k] + dp[k][j]) {
      dp[i][j] = dp[i][k] + dp[k][j];
    }
  }

  int ans = inf;
  REP(i, 1, N-1) REP(j, 1, N-1) {
    if(i == j) continue;
    minimize(ans, dp[0][i] + dp[i][j] + dp[j][N-1] + S[i] + S[j]);
  }

  cout << ans << endl;

  return 0;
}