import java.util.Scanner;

public class Main {
    
    public static void main(String[] args) {
        try (Scanner scan = new Scanner(System.in)) {
            int N = scan.nextInt();
            int stayCost[] = new int[N];
            for(int i=0; i<N; i++) {
                stayCost[i] = scan.nextInt();
            }
            int M = scan.nextInt();
            int moveCost[][] = new int[N][N];
            for(int i=0; i<N; i++) {
                for(int j=0; j<N; j++) {
                    moveCost[i][j] = 1000000;
                }
            }
            
            for(int i=0; i<M; i++) {
                int from = scan.nextInt();
                int to = scan.nextInt();
                int cost = scan.nextInt();
                moveCost[from][to] = cost;
                moveCost[to][from] = cost;
            }
            
            for(int k = 0; k < N; ++k) {
                for(int i = 0; i < N; ++i) {
                    for(int j = 0; j < N; ++j) {
                        moveCost[i][j] = Math.min(moveCost[i][j], moveCost[i][k] + moveCost[k][j]);
                    }
                }
            }
            
            int ans = Integer.MAX_VALUE;
            for(int i=1; i<N-1; i++) {
                for(int j=1; j<N-1; j++) {
                    if(i==j) continue;
                    int tmp = moveCost[i][0] + moveCost[j][i] + moveCost[N-1][j] + stayCost[i] + stayCost[j];
                    ans = Math.min(ans, tmp);
                }
            }
            
            System.out.println(ans);
        }
    }
}