#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <queue>
#include <set>
#include <map>
using namespace std;

#define FOR(i, s, e) for (int i = (s); i <= (e); i++)
#define INF 10000000;

int N;
int stay[50];

int M;


int dp[55][55];

int main()
{
    FOR(i, 0, 54)
    {
        FOR(j, 0, 54)
        {
            dp[i][j] = INF
        }
    }
    cin >> N;
    FOR(i, 0, N - 1)
    {
        cin >> stay[i];
    }

    cin >> M;
    int a, b, c;
    FOR(i, 0, M - 1)
    {
        cin >> a >> b >> c;
        dp[a][b] = c;
        dp[b][a] = c;
    }

    FOR(i,0,N - 1)
    {
        FOR(j,0,N - 1)
        {
            FOR(k,0,N - 1)
            {
                dp[j][k] = min(dp[j][k],dp[j][i] + dp[i][k]);
            }
        }
    }

    int res = INF;

    FOR(i,1,N - 2)
    {
        FOR(j,1,N - 2)
        {
            if(i != j)
            {
                res = min(res,dp[0][i] + stay[i] + dp[i][j] + stay[j] + dp[j][N - 1]);
            }
        }
    }

    cout << res << endl;
    return 0;
}