#include <bits/stdc++.h>
  
using namespace std;
  
#define rep(i,n) REP(i,0,n)
#define REP(i,s,e) for(int i=(s); i<(int)(e); i++)
#define repr(i, n) REPR(i, n, 0)
#define REPR(i, s, e) for(int i=(int)(s-1); i>=(int)(e); i--)
#define pb push_back
#define all(r) r.begin(),r.end()
#define rall(r) r.rbegin(),r.rend()
#define fi first
#define se second
  
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
 
const int INF = 1e9;
const ll MOD = 1e9 + 7;
double EPS = 1e-8;

ll d[51][51];

int main(){
    rep(i, 51) rep(j, 51) d[i][j] = (i == j ? 0 : 1e18);
    int n;
    cin >> n;
    vl a(n);
    rep(i, n) cin >> a[i];
    int m;
    cin >> m;
    rep(i, m) {
        int x, y, z;
        cin >> x >> y >> z;
        d[y][x] = d[x][y] = z;
    }
    rep(k, n) rep(i, n) rep(j, n) d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
    ll ans = 1e18;
    REP(i, 1, n-1) REP(j, 1, n-1) if(i != j) {
        ans = min(ans, d[0][i] + d[i][j] + d[j][n-1] + a[i] + a[j]);
    }
    cout << ans << endl;
    return 0;
}