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
70
71
72
73
74
#include <bits/stdc++.h>
#define e using u=ostream;template<class a,class b>u&operator<<(u&o,pair<a,b>&x)
using namespace std;e;u&operator<<(u&o,string&s){return o<<s.c_str();}template<
class t>auto operator<<(u&o,t&x)->decltype(x.end(),o){o<<'{';int i=2;for(auto y:
x)o<<", "+i<<y,i=0;return o<<'}';}e{return o<<'('<<x.first<<", "<<x.second<<')';}
#ifdef DEBUG
#define LOG(x...)cerr<<"["#x"]: ",[](auto...$){((cerr<<$<<"; "),...)<<'\n';}(x)
#else
#define LOG(...)
#endif
#define ff first
#define ss second
#define ll long long

vector <ll> przepust;
vector <vector <pair <int, ll> > > g;
vector <set <ll> > moce; 
ll res = -1;

int n, m;


void dfs(int v, ll moc) {
	if (moc > przepust[v]) {
		return;
	}
	if (v == n-1) {
		res = max(res, moc);
	}
	if (moce[v].find(moc) != moce[v].end()) {
		return;
	}
	moce[v].insert(moc);
	for (auto [w, c] : g[v]) {
		dfs(w, moc*c);
	}
}

void solve() {
	cin >> n >> m;
	g.clear();
	przepust.clear();
	g.resize(n);
	przepust.resize(n);
	moce.clear();
	moce.resize(n);
	for (int i = 0; i < n; i++) {
		cin >> przepust[i];
		moce[i].clear();
	}
	for (int i = 0; i < m; i++) {
		int a, b;
		ll c;
		cin >> a >> b >> c;
		a--; b--;
		g[a].emplace_back(b, c);
	}
	res = -1;
	dfs(0, 1);
	cout << res << "\n";
}

int main() {
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	int t;
	cin >> t;
	while (t--) {
		solve();
	}



}