#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(vector<point_t>& point, vector<vector<int> >& state, int stay_prev, int cur_p, int cur_c)
{
	if(!min_u(state[stay_prev][cur_p], cur_c)) return;
	int n=point.size();

	if(cur_p!=0 && cur_p!=n-1 && stay_prev<n && stay_prev!=cur_p)
	{
		int nc=cur_c+point[cur_p].s;
		int idx=cur_p;

		if(stay_prev>0) idx=n;
		if(state[idx][cur_p]<0 || state[idx][cur_p]>nc)
		{
			solve(point, state, idx, cur_p, nc);
		}
	}

	for(auto r: point[cur_p].road)
	{
		solve(point, state, stay_prev, r.to, cur_c+r.c);
	}
}


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

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

		state.resize(n+1);
		for(i=0;i<state.size();i++)
		{
			state[i].resize(n);
			fill(state[i].begin(), state[i].end(), -1);
		}

		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});
		}

		solve(point, state, 0, 0, 0);
/*
		for(int j=0;j<state.size();j++)
		{
			for(int i=0;i<n;i++) printf("%3d ", state[j][i]);
			printf("\n");
		}
*/
		printf("%d\n", state[n][n-1]);
	}

	return 0;
}