#include <bits/stdc++.h>

int main() {

  long wf[64][64];
  long cost[64];
  long N;
  long M;
  long A, B, C;

  for(int i = 0; i < 64; ++i) {
    for(int j = 0; j < 64; ++j) {
      wf[i][j] = 1000000000;
    }
  }

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

  std::cin >> M;
  for(int i = 0; i < M; ++i) {
    std::cin >> A >> B >> C;
    wf[A][B] = wf[B][A] = C;
  }

  for(int k = 0; k < N; ++k) {
    for(int i = 0; i < N; ++i) {
      for(int j = 0; j < N; ++j) {
	wf[i][j] = std::min(wf[i][j], wf[i][k] + wf[k][j]);
      }
    }
  }

  long ans = 1000000000;
  for(int i = 1; i < N-1; ++i) {
    for(int j = 1; j < N-1; ++j) {
      if( i != j ) {
	ans = std::min(ans, cost[i] + cost[j] + wf[0][i] + wf[i][j] + wf[j][N-1]);
      }
    }
  }

  std::cout << ans << std::endl;
  
  return 0;
}