#include <algorithm>
#include <cmath>
#include <cstring>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#include <iterator>

//#define pb push_back
#define puts(x) cout << #x << " : " << x << endl;
//#pragma GCC diagnostic ignored "-Wconversion"
//#define REP(i,n) for (int i=0;i<(n);i++)
//#define REPE(i,n) for (int i=0;i<=(n);i++)
//#define init(a,b) memset((a), (b), (sizeof(a)));
//#define PI 3.14159265
//#define EPS (1e-10)
//#define EQ(a,b) (abs((a)-(b)) < EPS)

using namespace std;

const int INF = 1000*1000;

typedef long long ll;
//#define int long long

int dxy[] = {0, 1, 0, -1, 0};

typedef pair<int, int> P;

int stay_cost[60];
//int edge_cost[60][60];
int d[60][60];

signed main() {
    int n;cin>>n;
    for(int i=0;i<n;i++)cin>>stay_cost[i];
    int m;cin>>m;

    for(int i=0;i<n;i++)fill(d[i], d[i]+n, INF);

    for(int i=0;i<m;i++){
        int a,b,c;cin>>a>>b>>c;
        d[a][b] = c;
        d[b][a] = c;
    }

    for(int k = 0; k < n; k++) {
        for(int i =0;i <n;i++){
            for(int j = 0;j < n; j++){
                d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
            }
        }
    }

    int res = INF;
    for(int i = 1; i < n-1; i++){
        for(int j = 1; j < n-1; j++){
            if(i == j) continue;
            res = min(res, d[0][i] + d[i][j] + d[j][n-1] + stay_cost[i] + stay_cost[j]);
        }
    }
    cout<<res<<endl;

    return 0;
}