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
#include <iostream>
#include <vector>
#include <set>
#include <map>
#include <algorithm>
#include <unordered_map>
#include <unordered_set>
#include <queue>
#include <deque>
#include <tuple>
#include <bitset>

using namespace std;

#define pb push_back
#define mp make_pair
#define st first
#define nd second
#define x first
#define y second

typedef long long ll;
typedef pair<ll, ll> pii;
typedef pair<ll, ll> pll;
typedef vector<ll> vi;
typedef vector<ll> vll;


vll P;
vector<vector<pll>> G;
vector<unordered_set<ll>> S;

void dfs(ll i, ll c){
    if(S[i].find(c) != S[i].end()){
        return;
    }

    S[i].insert(c);

    for(auto x: G[i]){
        if(x.nd * c <= P[x.st]){ 
            dfs(x.st, x.nd * c);
        }
    }
}

int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    
    ll T;
    cin >> T;

    while(T--){
        ll n, m;
        cin >> n >> m;

        P.clear();
        for(ll i=0; i<n; i++){
            ll p;
            cin >> p;
            P.pb(p);
        }
    
        for(ll i=0; i<n; i++){
            P[i] = min(P[i], P[n-1]);
        }
    
        G.clear();
        S.clear();

        for(ll i=0; i<n; i++){
            G.pb(vector<pll>());
            S.pb(unordered_set<ll>());
        }
    
        for(ll i=0; i<m; i++){
            ll a, b, w;
            cin >> a >> b >> w;
            G[a-1].pb(mp(b-1, w));
        }

        dfs(0, 1);
        ll ans = -1;
        for(auto x: S[n-1]){
            if(x>ans){
                ans = x;
            }
        }
        cout << ans << '\n';
    }


    return 0;
}