#include"bits/stdc++.h" //#include using namespace std; #define print(x) cout<> n; rep(i, 0, n)cin >> s[i]; cin >> m; rep(i, 0, m)cin >> a[i] >> b[i] >> c[i]; rep(i, 0, m) { rep(j, 0, m) { if (i == j)d[i][j] = 0; else d[i][j] = mod; } } rep(i, 0, m) { d[a[i]][b[i]] = c[i]; d[b[i]][a[i]] = c[i]; } warshall_floyd(); int ans = INT_MAX; rep(i, 1, n-1) { rep(j, 1, n-1) { if (i == j)continue; int cost = 0; cost = d[0][i] + d[i][j] + d[j][n - 1] + s[i] + s[j]; ans = min(ans, cost); } } print(ans); }