1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
#include <bits/stdc++.h>
using namespace std;
#define REP(i,a,b) for (int i = (a); i <= (b); ++i)
#define REPD(i,a,b) for (int i = (a); i >= (b); --i)
#define FORI(i,n) REP(i,1,n)
#define FOR(i,n) REP(i,0,int(n)-1)
#define mp make_pair
#define pb push_back
#define pii pair<int,int>
#define vi vector<int>
#define ll long long
#define SZ(x) int((x).size())
#define DBG(v) cerr << #v << " = " << (v) << endl;
#define FOREACH(i,t) for (typeof(t.begin()) i=t.begin(); i!=t.end(); i++)
#define fi first
#define se second

const int N = 111;

int n,m;
int p[N];
vector<pii> g[N];
set<int> vis[N];

void test() {
	scanf("%d%d", &n, &m);
	FOR(i,n) {
		g[i].clear();
		vis[i].clear();
	}
	FOR(i,n) scanf("%d", &p[i]);
	FOR(i,m) {
		int a,b,w;
		scanf("%d%d%d", &a, &b, &w);
		a--;
		b--;
		g[a].pb(mp(b,w));
	}
	priority_queue<pii> q;
	q.push(mp(-1,0));
	vis[0].insert(1);
	int ans = -1;
	while (!q.empty()) {
		pii cur = q.top();
		q.pop();
		int u = cur.se, mul = -cur.fi;
		FOR(i,SZ(g[u])) {
			int v = g[u][i].fi, w = g[u][i].se;
			ll nxt = 1LL * mul * w;
			if (nxt <= p[v]) {
				if (vis[v].find(nxt) == vis[v].end()) {
					q.push(mp(-nxt, v));
					vis[v].insert(nxt);
					if (v == n-1) {
						ans = max(ans, int(nxt));
					}
				}
			}
		}
	}
	printf("%d\n", ans);
}

int main() {
	int tt;
	scanf("%d", &tt);
	FOR(i,tt) test();
	return 0;
}