#include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include using namespace std; typedef long long ll; typedef unsigned int ui; const ll mod = 1000000007; const ll INF = (ll)1000000007 * 1000000007; typedef pair P; #define stop char nyaa;cin>>nyaa; #define rep(i,n) for(int i=0;i=0;i--) #define Rep(i,sta,n) for(int i=sta;i=sta;i--) #define rep1(i,n) for(int i=1;i<=n;i++) #define per1(i,n) for(int i=n;i>=1;i--) #define Rep1(i,sta,n) for(int i=sta;i<=n;i++) typedef long double ld; typedef complex Point; const ld eps = 1e-8; const ld pi = acos(-1.0); typedef pair LP; template void warshall_floyd(vector> &d){ int n=d.size(); for(int k=0;k> d; void solve(){ cin >> n; rep(i,n){ cin >> s[i]; } cin >> m; d.resize(n,{}); rep(i,n){ rep(j,n){ if (i==j) d[i].push_back(0); else d[i].push_back(INF); } } rep(i,m){ int a,b,c; cin >> a >> b >> c; d[a][b]=c; d[b][a]=c; } warshall_floyd(d); ll ans=INF; rep(i,n){ rep(j,n){ //cout << i << " " << j << " " << d[i][j] << endl; } } Rep(i,1,n-1){ Rep(j,i+1,n-1){ //cout << i << " " << j << " " << d[i][j] << endl; ans=min(ans,min(d[0][i]+d[i][j]+d[j][n-1]+s[i]+s[j],d[0][j]+d[j][i]+d[i][n-1]+s[i]+s[j])); } } cout << ans << endl; } int main(){ ios::sync_with_stdio(false); cin.tie(0); cout << fixed << setprecision(50); solve(); }