#include <bits/stdc++.h>
#define FOR(i,a,b) for (int i=(a);i<(b);i++)
#define FORR(i,a,b) for (int i=(a);i>=(b);i--)
#define pb push_back
#define pcnt __builtin_popcount
#define show(x) cout<<#x<<" = "<<x<<endl;
#define maxs(x,y) x = max(x,y)
#define mins(x,y) x = min(x,y)
#define fi first
#define se second
#define rng(a) a.begin(),a.end()
#define each(it,c) for(__typeof((c).begin()) it=(c).begin();it!=(c).end();it++)
#define sz(x) (int)(x).size()

using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<pii> vpii;
typedef set<int> si;
typedef pair<ll,ll> pll;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<pll> vpll;
typedef set<ll> sl;
template<typename T>string join(vector<T>&v)
{stringstream s;FOR(i,0,sz(v))s<<' '<<v[i];return s.str().substr(1);}
ll gcd(ll a,ll b){if(a>b)swap(a,b);for(;a>0;b%=a,swap(a,b));return b;}
int modpow(ll a,ll n,int m){if(a==0)return a;ll p=1;for(;n>0;n/=2,a=a*a%m)if(n&1)p=p*a%m;return(int)p;}

const int iinf = 1e9;
const ll linf = 1e18;
const int mod = 1e9+7;
const double eps = 1e-10;

struct Dijk{
  typedef pair<ll, int> pli;
  int n;
  vector<vpll> E;
  vi p;
  vl d;
  void init(const vector<vpll>&e){
    n = sz(e);
    E = e;
    FOR(i,0,n)sort(rng(E[i]));
    d.resize(n);
    p.resize(n);
  };
  void _solve(int S, int G){
    FOR(i, 0, n){
      d[i] = (i==S) ? 0 : linf;
      p[i] = -1;
    }
    priority_queue<pli, vector<pli>, greater<pli> > Q;
    Q.push(pll(0, S));
    pli t;
    vector<bool> F;
    FOR(i, 0, n)F.pb(false);
    ll f;
    int c = 0, s;
    while(!Q.empty()){
      t = Q.top();
      Q.pop();
      f = t.fi;
      s = t.se;
      if(F[s])continue;
      F[s] = true;
      if(s==G)break;
      c++;
      if(c==n)break;
      each(itr, E[s]){
        ll ff = itr->fi, ss = itr->se;
        if((!F[ff])&&(f + ss < d[ff])){
          d[ff] = f + itr->se;
          p[ff] = s;
          Q.push(pll(f + ss, ff));
        }
      }
    }
  }
  ll solve(int s, int g){
    _solve(s, g);
    return d[g];
  }
  void solve(int s){
    _solve(s, -1);
  }
};

int n, S[50], m;
vector<vpll> E;
ll d[50][50];
main(){
  cin.tie(0);
  ios::sync_with_stdio(false);
  cin >> n;
  FOR(i, 0, n) cin >> S[i];
  E.resize(n);
  cin >> m;
  FOR(i, 0, m){
    int a, b, c;
    cin >> a >> b >> c;
    E[a].pb(pll(b, c));
    E[b].pb(pll(a, c));
  }
  Dijk di;
  di.init(E);
  FOR(i,0,n-1)FOR(j,i+1,n){
    ll dd = di.solve(i, j);
    d[i][j] = dd;
    d[j][i] = dd;
  }
  ll ans = linf;
  FOR(i,1,n-1)FOR(j,1,n-1){
    if(i==j)continue;
    ans = min(ans,d[0][i] + d[i][j] + d[j][n-1] + S[i] + S[j]);
  }
  cout << ans << endl;
}