#include <iostream>
#include <vector>
#include <map>
#include <algorithm>
#include <limits.h>
#include <time.h>
#include <string>
#include <string.h>
#include <sstream>
#include <set>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <stack>
#include <queue>

using namespace std;

typedef long long ll;

const int MAX_N = 50;
const int INF = 999999;

int dist[MAX_N][MAX_N];
int stayCost[MAX_N];

void init(){
  for(int i = 0; i < MAX_N; i++){
    for(int j = 0; j < MAX_N; j++){
      dist[i][j] = INF;
    }
  }
}

int n;

void warshall_floyd() {
  for(int k = 0; k < n; k++){
    for(int i = 0; i < n; i++){
      for(int j = 0; j < n; j++){
        dist[i][j] = min(dist[i][j], dist[i][k] + dist[k][j]);
      }
    }
  }
}

int main(){
  init();

  cin >> n;

  for(int i = 0; i < n; i++){
    cin >> stayCost[i];
    dist[i][i] = 0;
  }

  int m;
  cin >> m;

  int from, to, cost;
  for(int i = 0; i < m; i++){
    cin >> from >> to >> cost;
    dist[from][to] = cost;
    dist[to][from] = cost;
  }

  warshall_floyd();

  int minCost = INT_MAX;

  for(int i = 1; i < n-1; i++){
    for(int j = 1; j < n-1; j++){
      if(i == j) continue;
      int cost = dist[0][i] + stayCost[i] + dist[i][j] + stayCost[j] + dist[j][n-1];

      minCost = min(minCost, cost);
    }
  }

  cout << minCost << endl;

  return 0;
}