#include <iostream>
#include <vector>
#include <string>
#include <stack>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <algorithm>	// require sort next_permutation count __gcd reverse etc.
#include <cstdlib>	// require abs exit atof atoi 
#include <cstdio>		// require scanf printf
#include <functional>
#include <numeric>	// require accumulate
#include <cmath>		// require fabs
#include <climits>
#include <limits>
#include <cfloat>
#include <iomanip>	// require setw
#include <sstream>	// require stringstream 
#include <cstring>	// require memset
#include <cctype>		// require tolower, toupper
#include <fstream>	// require freopen
#include <ctime>		// require srand
#define rep(i,n) for(int i=0;i<(n);i++)
#define ALL(A) A.begin(), A.end()
#define INF 1<<16
#define INF2 1<<28

using namespace std;

typedef long long ll;
typedef pair<int, int> P;

/*
	No.17 2つの地点に泊まりたい

	全点対最短路問題（ワーシャルフロイト法）

*/

const int MAX_V = 55;

int d[MAX_V][MAX_V];	// d[u][v] は辺 e = (u, v ) のコスト(存在しない場合は INF、ただし d[i][i] = 0 とする)

void warshall_floyd (int V )
{
	rep (k, V ){
		rep (i, V ){
			rep (j, V ){
				d[i][j] = min (d[i][j], d[i][k] + d[k][j] );
			} // end rep
		} // end rep
	} // end rep
}

int c[MAX_V];

int main()
{
	memset (c, 0, sizeof (c ) );
	rep (i, MAX_V ) rep (j, MAX_V ) d[i][j] = INF;
	rep (i, MAX_V ) d[i][i] = 0;

	ios_base::sync_with_stdio(0);
	int N; cin >> N;
	rep (i, N ) cin >> c[i];
	int M; cin >> M;
	rep (i, M ){
		int ai, bi, ci; cin >> ai >> bi >> ci;
		d[ai][bi] = ci;
		d[bi][ai] = ci;
	} // end rep

	warshall_floyd (N );

	int res = INF2;
	for (int i = 1; i < N - 1; i++ ){
		for (int j = 1; j < N - 1; j++ ){
			if (i == j ) continue;
			int curr = d[0][i] + c[i] + d[i][j] + c[j] + d[j][N-1];
			if (curr < res ){
//				cerr << curr << endl;
				res = curr;
			} // end if
		} // end for
	} // end for

	cout << res << endl; 

	return 0;
}