#include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rrep(i, n) for (int i = (n)-1; i >= 0; i--)
using namespace std;
typedef long long int lli;
lli MOD = 1000000007;
int dis[100][100] = {};
int main()
{
    int n, m;
    cin >> n;
    int s[1005];
    rep(i, n) cin >> s[i];
    rep(i, 100) rep(j, 100) dis[i][j] = 1e8;
    rep(i, 100) dis[i][i] = 0;
    cin >> m;
    int a, b, c;
    rep(i, m)
    {
        cin >> a >> b >> c;
        dis[a][b] = c;
        dis[b][a] = c;
    }
    int ans = 1e8;
    rep(k, n) rep(i, n) rep(j, n) dis[i][j] = min(dis[i][k] + dis[k][j], dis[i][j]);
    for (int i = 1; i < n - 1; i++)
        for (int j = 1; j < n - 1; j++) {
            if (i == j)
                continue;
            ans = min(s[i] + s[j] + dis[0][i] + dis[i][j] + dis[j][n - 1], ans);
        }
    cout << ans << endl;
}