#include <bits/stdc++.h>

using namespace std;
typedef long long ll;
typedef pair<ll, ll> p_ll;

template<class T>
void debug(T itr1, T itr2) { auto now = itr1; while(now<itr2) { cout << *now << " "; now++; } cout << endl; }
#define repr(i,from,to) for (int i=(int)from; i<(int)to; i++)
#define all(vec) vec.begin(), vec.end()
#define rep(i,N) repr(i,0,N)
#define per(i,N) for (int i=(int)N-1; i>=0; i--)

const ll MOD = pow(10,9)+7;
const ll LLINF = pow(2,61)-1;
const int INF = pow(2,30)-1;

vector<ll> fac;
void c_fac(int x=pow(10,6)+10) { fac.resize(x,true); rep(i,x) fac[i] = i ? (fac[i-1]*i)%MOD : 1; }
ll inv(ll a, ll m=MOD) { ll b = m, x = 1, y = 0; while (b!=0) { int d = a/b; a -= b*d; swap(a,b); x -= y*d; swap(x,y); } return (x+m)%m; }
ll nck(ll n, ll k) { return fac[n]*inv(fac[k]*fac[n-k]%MOD)%MOD; }
ll gcd(ll a, ll b) { if (a<b) swap(a,b); return b==0 ? a : gcd(b, a%b); }
ll lcm(ll a, ll b) { return a/gcd(a,b)*b; }

// ----------------------------------------------------------------------
// ----------------------------------------------------------------------

struct edge { ll to; ll d; };
vector<vector<edge>> adj;

vector<vector<ll>> WarshallFloyd() {
  int N = adj.size();
  vector<vector<ll>> result(N,vector<ll>(N,LLINF)); rep(i,N) result[i][i] = 0;
  rep(i,N) for (auto x: adj[i]) result[i][x.to] = x.d;
  rep(k,N) rep(i,N) rep(j,N) result[i][j] = min(result[i][j], result[i][k]+result[k][j]);
  return result;
}

// ----------------------------------------------------------------------
// ----------------------------------------------------------------------

int main() {
  int N; cin >> N;
  int A[N]; rep(i,N) cin >> A[i];
  adj.resize(N);
  int M; cin >> M;
  rep(i,M) {
    ll A, B, C; cin >> A >> B >> C;
    adj[A].push_back({B,C}); adj[B].push_back({A,C});
  }
  vector<vector<ll>> wf = WarshallFloyd();
  // rep(i,N) debug(all(wf[i]));

  ll result = LLINF;
  repr(p1,1,N-1) repr(p2,1,N-1) {
    if (p1==p2) continue;
    ll stay = A[0] + A[p1] + A[p2] + A[N-1];
    ll load = wf[0][p1] + wf[p1][p2] + wf[p2][N-1];
    result = min(result, stay+load);
  }
  cout << result << endl;
  return 0;
}