#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for(ll i = 0, i##_len = (n); i < i##_len; i++)
#define reps(i, s, n) for(ll i = (s), i##_len = (n); i < i##_len; i++)
#define rrep(i, n) for(ll i = (n) - 1; i >= 0; i--)
#define rreps(i, e, n) for(ll i = (n) - 1; i >= (e); i--)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define sz(x) ((ll)(x).size())
#define len(x) ((ll)(x).length())
#define endl "\n"

int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    // ifstream in("input.txt");
    // cin.rdbuf(in.rdbuf());
    const ll inf = LONG_LONG_MAX / 2 - 1;
    ll n;
    cin >> n;
    vector<ll> s(n);
    rep(i, n) cin >> s[i];
    vector<vector<ll>> d(n, vector<ll>(n, inf));
    rep(i, n) d[i][i] = 0;
    ll m;
    cin >> m;
    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]);
    ll ans = LONG_LONG_MAX;
    reps(i, 1, n - 1) {
        reps(j, 1, n - 1) {
            if ((i == j) || (d[0][i] == inf) || (d[i][j] == inf) || (d[j][n - 1] == inf)) continue;
            ll tmp = d[0][i] + s[i] + d[i][j] + s[j] + d[j][n - 1];
            ans = min(ans, tmp);
        }
    }
    cout << ans << endl;
    return 0;
}