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
 75
 76
 77
 78
 79
 80
 81
 82
 83
 84
 85
 86
 87
 88
 89
 90
 91
 92
 93
 94
 95
 96
 97
 98
 99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define vc vector
#define st first
#define nd second
#define pll pair<ll, ll>
#define sz(a) (ll)a.size()
#define all(a) a.begin(), a.end()
#define pub push_back
#define pob pop_back
const ll F = 32000;
const ll B = 32000;

struct Edge {
	ll v, wgh;
};

struct State {
	ll v, prod, x;
};

ll V, E;
vc<ll> p;
vc<vc<Edge>> g, h;
vc<vc<bool>> vis;
vc<vc<ll>> cnd;
vc<vc<ll>> dp;

void init() {
	cin >> V >> E;
	g.assign(V, vc<Edge>());
	h.assign(V, vc<Edge>());
	p.resize(V);
	for (ll &pi : p)
		cin >> pi;
	for (ll i = 0; i < E; i++) {
		ll v, w, wgh;
		cin >> v >> w >> wgh;
		v--, w--;
		g[v].pub({w, wgh});
		h[w].pub({v, wgh});
	}
	vis.assign(V, vc<bool>(F, false));
	cnd.assign(V, vc<ll>());
}

void forward(ll v = 0, ll prod = 1) {
	vis[v][prod] = true;
	for (auto &e : g[v]) {
		ll nprod = prod * e.wgh;
		if (nprod > p[e.v])
			continue;
		if (nprod >= F) {
			cnd[e.v].pub(nprod);
			continue;
		}
		if (vis[e.v][nprod])
			continue;
		forward(e.v, nprod);
	}
}

void backward() {
	dp.assign(V, vc<ll>(B, 0));
	dp[V - 1][1] = p[V - 1];
	auto cmp = [&](auto &v, auto &w) {
		if (v.prod != w.prod)
			return v.prod > w.prod;
		return v.x < w.x;
	};
	priority_queue<State, vc<State>, decltype(cmp)> pq(cmp);
	pq.push({V - 1, 1, p[V - 1]});
	while (not pq.empty()) {
		auto v = pq.top();
		pq.pop();
		if (dp[v.v][v.prod] != v.x)
			continue;
		for (auto &e : h[v.v]) {
			ll wprod = v.prod * e.wgh;
			ll wx = min(p[e.v], v.x / e.wgh);
			if (wprod >= B or wx <= dp[e.v][wprod])
				continue;
			dp[e.v][wprod] = wx;
			pq.push({e.v, wprod, wx});
		}
	}
}

ll meet() {
	ll ret = 0;
	for (ll v = 0; v < V; v++) {
		vc<ll> z(F, 0);
		for (ll i = 1; i < F; i++) {
			z[i] = z[i - 1];
			if (vis[v][i])
				z[i] = i;
		}
		set<ll> s(all(cnd[v]));
		for (ll i = 1; i < B; i++) {
			ret = max(ret, i * z[min(F - 1, dp[v][i])]);
			auto find = s.upper_bound(dp[v][i]);
			if (find == s.begin())
				continue;
			find--;
			ret = max(ret, i * (*find));
		}
	}
	if (ret == 0)
		ret = -1;
	return ret;
}

void program() {
	init();
	forward();
	backward();
	cout << meet() << "\n";
}

int main() {
	ios_base::sync_with_stdio(false);
	cin.tie(nullptr);
	cout.tie(nullptr);
	ll T = 1;
	cin >> T;
	while (T--)
		program();
	return 0;
}