#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
typedef long long int ll;
typedef long double ld;
#define FOR(i,l,r) for(ll i=l;i<r;i++)
#define REP(i,n) FOR(i,0,n)
#define RFOR(i,l,r) for(ll i=r-1;i>=l;i--)
#define RREP(i,n) RFOR(i,0,n)
#define ALL(x) x.begin(),x.end()
#define P pair<ll,ll>
#define F first
#define S second
#define BS(A,x) binary_search(ALL(A),x)
#define LB(A,x) (ll)(lower_bound(ALL(A),x)-A.begin())
#define UB(A,x) (ll)(upper_bound(ALL(A),x)-A.begin())
#define COU(A,x) UB(A,x)-LB(A,x)
template<typename T>using min_priority_queue=priority_queue<T,vector<T>,greater<T>>;
using mint=modint1000000007;
signed main(){
  ll N,M,ans=1e18;cin>>N;vector<vector<ll>>D(N,vector<ll>(N,1e18));vector<ll>S(N);
  REP(i,N)cin>>S[i];cin>>M;REP(i,N)D[i][i]=0;
  REP(i,M){ll A,B,C;cin>>A>>B>>C;D[A][B]=C;D[B][A]=C;}
  REP(i,N)REP(j,N)REP(k,N)D[j][k]=min(D[j][k],D[j][i]+D[i][k]);
  FOR(i,1,N-1)FOR(j,1,N-1)if(i!=j)ans=min(D[0][i]+D[i][j]+D[j][N-1]+S[i]+S[j],ans);
  cout<<ans<<endl;
  return 0;
}