#include using namespace std; #define _p(...) (void)printf(__VA_ARGS__) #define forr(x,arr) for(auto&& x:arr) #define _overload3(_1,_2,_3,name,...) name #define _rep2(i,n) _rep3(i,0,n) #define _rep3(i,a,b) for(int i=int(a);i=int(a);i--) #define rrep(...) _overload3(__VA_ARGS__,_rrep3,_rrep2,)(__VA_ARGS__) #define all(x) (x).begin(), (x).end() #define bit(n) (1LL<<(n)) #define sz(x) ((int)(x).size()) #define fst first #define snd second using ll=long long;using pii=pair;using vb=vector; using vi=vector;using vvi=vector;using vvvi=vector; using vl=vector;using vvl=vector;using vvvl=vector; using vd=vector;using vvd=vector;using vvvd=vector; using vpii=vector;using vvpii=vector;using vvvpii=vector; template T read() {T t; cin >> t; return t;} void Main() { int n = read(); vector S(n); rep(i, n) S[i] = read(); int m = read(); const int inf = 1e9; vvi D(n, vi(n, inf)); rep(i, n) D[i][i] = 0; rep(i, m) { int u = read(); int v = read(); int w = read(); D[u][v] = D[v][u] = w; } rep(k, n) { rep(i, n) { if (D[i][k] < inf) { rep(j, n) { if (D[i][j] > D[i][k] + D[k][j]) { D[i][j] = D[i][k] + D[k][j]; } } } } } ll ans = inf; rep(i, 1, n-1) rep(j, 1, n-1) if (i != j) { ans = min(ans, 0LL + D[0][i] + S[i] + D[i][j] + S[j] + D[j][n-1]); } cout << ans << endl; } int main() { cin.tie(nullptr); ios::sync_with_stdio(false); Main(); return 0; }