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
// Karol Kosinski 2025
#include <bits/stdc++.h>
#define FOR(i,a,b) for(int i=(a),_b=(b);i<_b;++i)
#define FR_(i,a,b) for(int i=(a),_b=(b);i<=_b;++i)
#define FD_(i,b,a) for(int i=(b),_a=(a);i>=_a;--i)
#define ALL(c) (c).begin(),(c).end()
#define SIZE(c) int((c).size())
#define X first
#define Y second
#define endl '\n'
#define NAM(x) #x,'=',x
using namespace std;
using LL = long long;
using ULL = unsigned long long;
using PII = pair<int, int>;
using TIII = tuple<int, int, int>;
template<class...T> void _cout(T...a){(cout<<...<<a);}

#ifndef ENABLE_DEBUG
#define DEB(k,p,f,x...)
#else
#define DEB(k,p,f,x...) {if(k)_cout("------",setw(4),__LINE__," : ",__FUNCTION__,endl);if(p)f(x);}
#endif
#define DEBF(f,x...)    DEB(1,1,f,x)
#define DEBL            DEBF(void,0)
#define DEBC(p,x...)    DEB(0,p,_cout,x)
#define DEBUG(x...)     DEBC(1,x)

constexpr int NX = 103;
constexpr int VX = 1'000'000'002;

vector<PII> G[NX];
set<PII> S;
int Limit[NX];
int n, m, res = -1;

bool rec(int u, int prod)
{
    if ( S.contains(pair(u, prod)) )
    {
        return false;
    }
    S.emplace(u, prod);
    if ( u == n )
    {
        res = max( res, prod );
        if ( res == Limit[n] ) return true;
    }
    for ( auto [ w, v ] : G[u] )
    {
        int new_prod = w * prod;
        if ( new_prod <= Limit[v] )
        {
            if ( rec( v, new_prod ) ) return true;
        }
    }
    return false;
}

void solve()
{
    cin >> n >> m;
    FR_(i,1,n) cin >> Limit[i];
    FR_(i,1,m)
    {
        int x, y, w;
        cin >> x >> y >> w;
        if ( x != y or w != 1 ) G[x].emplace_back( w, y );
    }
    FR_(i,1,n)
    {
        sort( ALL(G[i]), greater<PII>() );
    }
    rec( 1, 1 );
    cout << res << endl;
    {
        res = -1;
        FR_(i,1,n) G[i].clear();
        S.clear();
    }
}

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    int z; cin >> z;
    while ( z -- ) solve();
    return 0;
}