#include <bits/stdc++.h>

using namespace std;

#define REP(i, n)   for(int i = 0; i < (n); i++)
#define REPS(i, n)  for(int i = 1; i <= (n); i++)
#define RREP(i, n)  for(int i = (n)-1; i >= 0; i--)
#define RREPS(i, n) for(int i = (n); i > 0; i--)
#define ALL(v) v.begin(), v.end()
#define RALL(v) v.rbegin(), v.rend()
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end())
#define mp make_pair
#define mt make_tuple
#define pb push_back

using ll  = long long;
using pi  = pair<int, int>;
using pl  = pair<ll, ll>;
using vi  = vector<int>;
using vl  = vector<ll>;
using vs  = vector<string>;
using vb  = vector<bool>;
using vvi = vector<vi>;

// const int MOD = 1e9 + 7;
const ll MOD = 1000003;
const int INF = 1e9 + 7;
const ll  INFL = 1e18;
const double PI = 3.141592653589793;
const double EPS = 1e-9;

template<class T> bool chmax(T &a, const T &b) { if(a < b) { a = b; return true; } return false; }
template<class T> bool chmin(T &a, const T &b) { if(a > b) { a = b; return true; } return false; }

signed main()
{
    cin.tie(0);
    ios::sync_with_stdio(false);
    cout << fixed << setprecision(20);

    int N; cin >> N;
    vl S(N); REP(i, N) cin >> S[i];
    int M; cin >> M;
    vector<vl> G(N, vl(N, INF));
    REP(i, M)
    {
        ll A, B, C; cin >> A >> B >> C;
        G[A][B] = C;
        G[B][A] = C;
    }

    REP(k, N)
    {
        REP(i, N)
        {
            REP(j, N) chmin(G[i][j], G[i][k] + G[k][j]);
        }
    }

    ll ans = INF;
    for(int i = 1; i < N-1; i++)
    {
        for(int j = i+1; j < N-1; j++)
        {
            chmin(ans, min(G[0][i]+G[i][j]+G[j][N-1], G[0][j]+G[j][i]+G[i][N-1])+S[i]+S[j]);
        }
    }
    cout << ans << endl;
}