#include <vector>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cctype>
#include <string>
#include <cstring>
#include <ctime>
#include <fstream>

#define INF 100000000
#define EPS 1e-9

using namespace std;

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

#define MAX_N 50
#define MAX_M 100000

int N;
int M;
int S[MAX_N];

int d[MAX_N][MAX_N];

int main() {

	cin >> N;
	for (int i = 0; i < N; i++){
		cin >> S[i];
	}

	for (int i = 0; i < N; i++){
		for (int j = 0; j < N; j++){
			d[i][j] = INF;
		}
	}

	cin >> M;

	for (int i = 0; i < M; i++){
		int a, b, c;
		cin >> a >> b >> c;
		d[a][b] = 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 ans = INF;

	for (int i = 1; i < N-1; i++){
		for (int j = 1; j < N - 1; j++){
			if (i == j)
				continue;

			int tmp = d[0][i] + d[j][N-1] + d[i][j] + S[i] + S[j];
			ans = min(ans, tmp);

		}
	}

	cout << ans << endl;

	return 0;
}