using System;
using System.Collections;
using System.Collections.Generic;
using System.Collections.Specialized;
using System.Text;
using System.Text.RegularExpressions;
using System.Linq;
using System.IO;
using System.ComponentModel;

class Program
{
    static void Main(string[] args)
    {
        new Magatro().Solve();
    }
}

public class Scanner
{
    private StreamReader Sr;
    private string[] S;
    private int Index;
    private const char Separator = ' ';

    public Scanner() : this(Console.OpenStandardInput())
    {
        Index = 0;
        S = new string[0];
    }
    public Scanner(Stream source)
    {
        Sr = new StreamReader(source);
    }

    private string[] Line()
    {
        return Sr.ReadLine().Split(Separator);
    }

    public string Next()
    {
        string result;
        if (Index >= S.Length)
        {
            S = Line();
            Index = 0;
        }
        result = S[Index];
        Index++;
        return result;
    }
    public T Next<T>()
    {
        var converter = TypeDescriptor.GetConverter(typeof(T));
        return (T)converter.ConvertFromString(Next());

    }
    public int NextInt()
    {
        return int.Parse(Next());
    }
    public double NextDouble()
    {
        return double.Parse(Next());
    }
    public long NextLong()
    {
        return long.Parse(Next());
    }
    public decimal NextDecimal()
    {
        return decimal.Parse(Next());
    }
    public string[] StringArray(int index = 0)
    {
        Next();
        Index = S.Length;
        return S.Skip(index).ToArray();
    }
    public int[] IntArray(int index = 0)
    {
        return StringArray(index).Select(int.Parse).ToArray();
    }
    public long[] LongArray(int index = 0)
    {
        return StringArray(index).Select(long.Parse).ToArray();
    }
    public bool EndOfStream
    {
        get { return Sr.EndOfStream; }
    }
}

public class Magatro
{

    private int[,] Dist;
    private int N;
    private int[] S;
    private int M;
    private const int Infinity = 999999;

    private void Scan()
    {
        Scanner cin = new Scanner();
        N = cin.NextInt();
        S = new int[N];
        for (int i = 0; i < N; i++)
        {
            S[i] = cin.NextInt();
        }

        M = cin.NextInt();
        Dist = new int[N, N];
        for (int i = 0; i < N; i++)
        {
            for (int j = 0; j < N; j++)
            {
                Dist[i, j] = Infinity;
            }
        }
        for (int i = 0; i < M; i++)
        {
            int a = cin.NextInt();
            int b = cin.NextInt();
            int c = cin.NextInt();
            Dist[a, b] = c;
            Dist[b, a] = c;
        }
    }

    public void Solve()
    {
        Scan();
        for (int k = 0; k < N; k++)
        {
            for (int i = 0; i < N; i++)
            {
                for (int j = 0; j < N; j++)
                {
                    Dist[i, j] = Math.Min(Dist[i, j], Dist[i, k] + Dist[k, j]);
                }
            }
        }
        int anser = int.MaxValue;
        for (int a = 1; a < N - 1; a++)
        {
            for (int b = 1; b < N - 1; b++)
            {
                if (a == b) continue;

                int distCost = Dist[0, a] + Dist[a, b] + Dist[b, N - 1];
                int stayCost = S[a] + S[b];
                anser = Math.Min(distCost + stayCost, anser);
            }
        }
        Console.WriteLine(anser);
    }
}