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


using namespace std;
#define ll long long
#define ld long double
#define all(a) (a).begin(), (a).end()
#define allr(a) (a).rbegin(), (a).rend()
#define F first
#define S second
#define pb push_back
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;

/*
#ifndef ONLINE_JUDGE
#include <cpp-dump.hpp>
#endif
*/

constexpr ll mod = 1e9+7;

ll power(ll a, ll b){
    ll res = 1;
    while(b){
        if(b&1) res = res * a % mod;
        a = a * a % mod;
        b >>= 1;
    }
    return res;
}

void dzik77() {

    int n,m; cin >> n >> m;
    vector<vector<pii>> a(n);
    vector<ll> p(n);
    for(auto&x:p) cin >> x;
    for (int i = 0; i < m; i++){
        int u,v,w; cin >> u >> v >> w;
        u--; v--;
        a[u].pb({v,w});
    }

    vector<unordered_set<ll>> dp(n);
    dp[0].insert(1);
    queue<pll> q;
    q.push({0,1});
    while(!q.empty()){
        auto [u,val] = q.front(); q.pop();
        for(auto [v,w]:a[u]){
            ll nval = val*w;
            if(nval > p[v] || dp[v].count(nval)) continue;
            dp[v].insert(nval);
            q.push({v,nval});
        }
    }

    ll ans = -1;
    for (auto x:dp[n-1]){
        ans = max(ans,x);
    }
    cout << ans << '\n';

}

int32_t main()
{

    ios::sync_with_stdio(0);
    cin.tie(0);

    int t = 1;
    cin >> t;
    while(t--)
		dzik77();

    return 0;
}