using System;

namespace No17_1{
    public class Program{
        public static void Main(string[] args){
            var sr = new StreamReader();
            //---------------------------------
            var N = sr.Next<int>();
            var S = sr.Next<int>(N);

            var M = sr.Next<int>();
            var wf = new WarshallFloyd(N);
            for(var i = 0; i < M; i++){
                var A = sr.Next<int>();
                var B = sr.Next<int>();
                var C = sr.Next<int>();
                wf.AddEdge(A, B, C);
                wf.AddEdge(B, A, C);
            }

            var dist = wf.Solve();
            var res = int.MaxValue;
            for(var i = 1; i < N - 1; i++){
                for(var j = 1; j < N - 1; j++){
                    if(i == j) continue;
                    if(dist[0][i] == int.MaxValue || dist[i][j] == int.MaxValue || dist[j][N - 1] == int.MaxValue) continue;
                    res = Math.Min(res, dist[0][i] + S[i] + dist[i][j] + S[j] + dist[j][N - 1]);
                }
            }

            Console.WriteLine(res);
            //---------------------------------
        }
    }

    public class WarshallFloyd{
        private readonly int _v;
        private readonly int[][] _dist;

        public WarshallFloyd(int v){
            _v = v;
            _dist = new int[v][];
            for(var i = 0; i < v; i++){
                _dist[i] = new int[v];
            }

            for(var i = 0; i < v; i++){
                for(var j = 0; j < v; j++){
                    if(i != j) _dist[i][j] = int.MaxValue;
                }
            }
        }

        public void AddEdge(int from, int to, int cost){
            _dist[from][to] = cost;
        }

        public int[][] Solve(){
            for(var k = 0; k < _v; k++){
                for(var i = 0; i < _v; i++){
                    for(var j = 0; j < _v; j++){
                        if(_dist[i][k] != int.MaxValue && _dist[k][j] != int.MaxValue){
                            _dist[i][j] = Math.Min(_dist[i][j], _dist[i][k] + _dist[k][j]);
                        }
                    }
                }
            }

            for(var i = 0; i < _v; i++){
                if(_dist[i][i] < 0) return null;
            }

            return _dist;
        }
    }

    public class StreamReader{
        private readonly char[] _c = {' '};
        private int _index = -1;
        private string[] _input = new string[0];
        private readonly System.IO.StreamReader _sr = new System.IO.StreamReader(Console.OpenStandardInput());

        public T Next<T>(){
            if(_index == _input.Length - 1){
                _index = -1;
                while(true){
                    string rl = _sr.ReadLine();
                    if(rl == null){
                        if(typeof(T).IsClass) return default(T);
                        return (T)typeof(T).GetField("MinValue").GetValue(null);
                    }
                    if(rl != ""){
                        _input = rl.Split(_c, StringSplitOptions.RemoveEmptyEntries);
                        break;
                    }
                }
            }
            return (T)Convert.ChangeType(_input[++_index], typeof(T), System.Globalization.CultureInfo.InvariantCulture);
        }

        public T[] Next<T>(int x){
            var ret = new T[x];
            for(var i = 0; i < x; ++i) ret[i] = Next<T>();
            return ret;
        }

        public T[][] Next<T>(int y, int x){
            var ret = new T[y][];
            for(var i = 0; i < y; ++i) ret[i] = Next<T>(x);
            return ret;
        }
    }
}