#include <bits/stdc++.h>

using namespace std;
#define rep(i,n) for (int i = 0; i < (int)(n); ++i)
#define rrep(i,n) for (int i = (int)(n-1); i >= 0; --i)
#define Rep(i,a,b) for (int i = a; i < b; ++i)
#define rRep(i,a,b) for (int i = a; i > b; --i)
#define fore(i,a) for(auto &i:a)
#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(),(x).rend()
#define Bit(x,i) (((x)>>(i))&1)
using ll = long long;
using vi = vector<int>;
using vll = vector<long long>;
using vvi = vector<vi>;
using vvll = vector<vll>;
using vb = vector<bool>;
using vs = vector<string>;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
struct settings{settings(){ios_base::sync_with_stdio(0); cin.tie(0); cout<<fixed<<setprecision(15);};}settingss;
const double PI = acos(-1);
const int INF = 1001001001;
const ll LINF = 1001001001001001001LL;


vvll G(100, vll(100, LINF));
void warshall_floyd(int n) {
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < n; j++) {
      for (int k = 0; k < n; k++) {
        G[j][k] = min(G[j][k], G[j][i] + G[i][k]);
      }
    }
  }
}

ll S[100];

int main() {
  int N; cin >> N;
  rep(i, N) cin >> S[i];
  int M; cin >> M;
  rep(i, M) {
    ll A, B, C; cin >> A >> B >> C;
    G[A][B] = C;
    G[B][A] = C;
  }
  warshall_floyd(N);
  ll ans = LINF;
  Rep(i, 1, N-1) {
    Rep(j, 1, N-1) {
      if(i == j) continue;
      chmin(ans, G[0][i] + S[i] + G[i][j] + S[j] + G[j][N-1]);
    }
  }
  cout << ans << endl;
}