#include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <sstream>
#include <cstring>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <queue>
#include <stack>
#include <map>
#include <set>
#include <numeric>
#include <cctype>
#include <tuple>
#include <climits>
#include <bitset>
#include <cassert>
#include <random>

#ifdef _MSC_VER
#include <agents.h>
#endif

#define FOR(i, a, b) for(int i = (a); i < (int)(b); ++i)
#define rep(i, n) FOR(i, 0, n)
#define ALL(v) v.begin(), v.end()
#define REV(v) v.rbegin(), v.rend()
#define MEMSET(v, s) memset(v, s, sizeof(v))
#define UNIQUE(v) (v).erase(unique(ALL(v)), (v).end())
#define MP make_pair
#define MT make_tuple

using namespace std;

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

const int N = 55;
int dist[N][N];

int main(){
	cin.tie(0);
	ios::sync_with_stdio(false);

	int n;
	cin >> n;
	vector<int> s(n);
	rep(i, n) cin >> s[i];

	int m;
	cin >> m;
	rep(i, N) rep(j, N) if (i != j) dist[i][j] = 1e9;
	rep(i, m){
		int a, b, c;
		cin >> a >> b >> c;
		dist[a][b] = dist[b][a] = c;
	}

	rep(i, n) rep(j, n) rep(k, n) dist[j][k] = min(dist[j][k], dist[j][i] + dist[i][k]);

	int ans = 1e9;
	FOR(i, 1, n - 1) FOR(j, 1, n - 1){
		if (i == j) continue;
		ans = min(ans, s[i] + s[j] + dist[0][i] + dist[i][j] + dist[j][n - 1]);
	}
	cout << ans << endl;

	return 0;
}