#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
#ifdef __LOCAL
 #include <debug>
#else
 #define debug(...) void(0)
#endif

#define REP(i,n) for(int i=0;i<(n);i++)
#define ALL(v) v.begin(),v.end()

template<typename T>
istream& operator>>(istream&is,vector<T>&v){
  for(T&p:v)is>>p;
  return is;
}
template<typename T>
ostream& operator<<(ostream&os,const vector<T>&v){
  if(&os==&cerr)os<<"[";
  for(int i=0;i<v.size();i++){
    os<<v[i];
    if(i+1<v.size())os<<(&os==&cerr?",":" ");
  }
  if(&os==&cerr)os<<"]";
  return os;
}

int d[50][50];
template<typename T>
bool chmin(T &a,T b){
  return (a>b&&(a=b,true));
}

int main(){
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
  int n;cin>>n;
  vector<int> s(n);cin>>s;
  REP(i,n)REP(j,n)if(i!=j)d[i][j]=1e8;
  int m;cin>>m;
  REP(_,m){
    int a,b,c;cin>>a>>b>>c;
    d[a][b]=d[b][a]=c;
  }
  REP(_,3)REP(k,n)REP(i,n)REP(j,n)chmin(d[i][j],d[i][k]+d[k][j]);
  int ans=1e9;
  for(int i=1;i<n-1;i++)for(int j=1;j<n-1;j++)if(i!=j)
    chmin(ans,d[0][i]+d[i][j]+d[j][n-1]+s[i]+s[j]);
  cout<<ans<<endl;
}