#include <iostream>
#include <cstring>
#include <algorithm>
#include <limits.h>
#include <cmath>
#include <time.h>
#include <functional>
#define REP(i,a,b) for(i=a;i<b;i++)
#define rep(i,n) REP(i,0,n)
#define MOD1 1000000007;
#define MOD2 1000007
using namespace std;

typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
/* ここからが本編 */
/*  */
int main(void)
{
  int test = 1;
  int i,j,k,l;
  int N,M;
  int S[50];
  int A[1250];
  int B[1250];
  int C[1250];
  int sum[50] = {0};
  cin >> N;
  rep(i,N) {
    scanf("%d",&S[i]);
  }
  scanf("%d",&M);
  rep(i,M) {
    scanf("%d",&A[i]);
    scanf("%d",&B[i]);
    scanf("%d",&C[i]);
  }
  for(i=1;i<N-1;i++) {
    int tmp = MOD1;
    for(j=0;j<M;j++) {
      if(B[j] != i || A[j] > i-1) continue;
      if(tmp > sum[A[j]] + C[j]) tmp = sum[A[j]] + C[j];
    }
    for(j=0;j<M;j++) {
      if(A[j] != i || B[j] > i-1) continue;
      if(tmp > sum[B[j]] + C[j]) tmp = sum[B[j]] + C[j];
    }
    sum[i] = tmp+S[i];
  }
  for(i=N-1;i<N;i++) {
    int tmp = MOD1;
    for(j=0;j<M;j++) {
      if(B[j] != i || A[j] > i-1 || A[j] == 0) continue;
      if(tmp > sum[A[j]] + C[j]) tmp = sum[A[j]] + C[j];
    }
    for(j=0;j<M;j++) {
      if(A[j] != i || B[j] > i-1 || B[j] == 0) continue;
      if(tmp > sum[B[j]] + C[j]) tmp = sum[B[j]] + C[j];
    }
    sum[i] = tmp+S[i];
  }
  rep(i,N) printf("sum[%d] = %d\n",i,sum[i]);
  cout << sum[N-1] << endl;
  return 0;
}