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
#include <bits/stdc++.h>

#define ll long long
#define ld long double
#define endl '\n'
#define st first
#define nd second
#define pb push_back
#define sz(x) (int)(x).size()
#define all(x) (x).begin(), (x).end()
#define FOR(i,l,r) for(int i=(l);i<=(r);i++)
#define ROF(i,r,l) for(int i=(r);i>=(l);i--)
using namespace std;
ll infl=1000000000000000007;
int inf=1000000007;

#ifdef DEBUG
auto&operator<<(auto&o,pair<auto,auto>p){return o<<"("<<p.first<<", "<<p.second<<")";}
auto operator<<(auto&o,auto x)->decltype(x.end(),o){o<<"{";int i=0;for(auto e:x)o<<","+!i++<<e;return o<<"}";}
#define debug(X...)cerr<<"["#X"]: ",[](auto...$){((cerr<<$<<"; "),...)<<endl;}(X)
#else
#define debug(...){}
#endif

const int N=107,M=207;

int p[N];
map<int,int>d[N];
vector<pair<int,int>>G[N];

signed main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    srand(time(NULL));
    int tt;
    cin>>tt;
    while(tt--)
    {
		int n,m;
		cin>>n>>m;
		FOR(i,1,n) cin>>p[i];
		FOR(i,1,m)
		{
			int a,b,w;
			cin>>a>>b>>w;
			G[b].pb({a,w});
		}
		priority_queue<pair<pair<int,int>,int>>Q;
		Q.push({{p[n],1},n});
		d[n][p[n]]=1;
		int ans=-1;
		while(sz(Q)>0)
		{
			int v=Q.top().nd,r=Q.top().st.st,x=Q.top().st.nd;
			Q.pop();
			if(d[v][r]!=x) continue;
			debug(v,r,x);
			if(v==1) ans=max(ans,x);
			for(auto [u,w]:G[v])
			{
				int t=min(r/w,p[u]);
				if(t>0&&x*w>d[u][t]) 
				{
					d[u][t]=x*w;
					Q.push({{t,x*w},u});
				}
			}
		}
		cout<<ans<<endl;
		FOR(i,1,n) 
		{
			d[i].clear();
			G[i].clear();
		}
	}
    
    
    
    return 0;
}
/*
for t in test/*.in; do
echo $t
o=${t%.in}.out
diff -w $o <(./B5 < $t) || break
done
*/