#include<cstdio>
#include<vector>
#include<queue>


using namespace std;


typedef long long ll;


struct road_t
{
	int to, c;
};


struct point_t
{
	int s;
	vector<road_t> road;
};


int min_u(int& m, int v)
{
	if(m>v || m<0)
	{
		m=v;
		return 1;
	}
	return 0;
}


void solve_r(vector<point_t>& point, vector<int>& dp, int cur_p, int cur_c, int prev_stay)
{
	int n=point.size();
	int idx=prev_stay*n+cur_p;

	if(min_u(dp[idx], cur_c)==0) return;

	for(auto r: point[cur_p].road)
	{
		solve_r(point, dp, r.to, cur_c+r.c, prev_stay);
	}

	if(cur_p==0 || cur_p==n-1) return;
	if(prev_stay==cur_p || prev_stay==n-1) return;

	int n_stay=cur_p;
	if(prev_stay>0) n_stay=n-1;
	solve_r(point, dp, cur_p, cur_c+point[cur_p].s, n_stay);
}


int solve(vector<point_t>& point)
{
	int n=point.size();
	vector<int> dp(n*n, -1);

	solve_r(point, dp, 0, 0, 0);
//for(int i=0;i<n*n;i++) printf("%3d %s", dp[i], (i+1)%n==0?"\n":"");
	return dp.back();
}


int main(void)
{
	int n, m, i, a, b, c;
	vector<point_t> point;

	while(scanf("%d", &n)==1)
	{
		point.clear();
		point.resize(n);

		for(i=0;i<n;i++)
		{
			scanf("%d", &point[i].s);
		}
		scanf("%d", &m);
		for(i=0;i<m;i++)
		{
			scanf("%d%d%d", &a, &b, &c);
			point[a].road.push_back((road_t){b, c});
			point[b].road.push_back((road_t){a, c});
		}

		printf("%d\n", solve(point));
	}

	return 0;
}