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

#define mp make_pair
#define pb push_back
#define st first
#define nd second
#define fi first
#define se second
#define vt vector
#define FOR(a, b, c)  for(int a=b; a<c; ++a)
#define all(a)     (a).begin(),(a).end()
#define sz(a)      (int)(a).size()

typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> pll;
typedef pair<int, int> pii;
typedef vector<int> vi; 
typedef vector<ll> vll;
typedef pii PII;
typedef pll PLL;

constexpr ll nax = 2e5+6969, INF = 1e9+2137;
constexpr ld eps = 1e-9;

mt19937_64 rng(6969);
// mt19937_64 rng(chrono::system_clock::now().time_since_epoch().count());

inline ll rand(ll l, ll r) {
	return uniform_int_distribution<ll>(l, r)(rng);
}

void test_case() {
    int n, m; 
    cin >> n >> m; 
    vll P(n), ans(n+1, -1); 
    vector<vector<pll>> v(n+1);

    for(auto &e: P)
        cin >> e; 

    for(int i = 0; i < m; i++) {
        int a, b, w; 
        cin >> a >> b >> w; 
        // if(w == 1)
        //     continue; 
        
        v[a].pb(mp(b, w)); 
    }

    // for(auto e: v) {
    //     for(auto f: e) {
    //         cout << f.fi << " " << f.se << "\n"; 
    //     }
    //     cout << "\n"; 
    // }

    ans[1] = 1; 
    queue<pll> q; 
    set<pll> vis; 
    
    q.push(mp(1, 1));
    
    while(!q.empty()) {
        int cur = q.front().fi; 
        ll w = q.front().se;    
        q.pop(); 

        vis.insert(mp(cur, w)); 

        // cout << cur << " " << w << "\n"; 

        ans[cur] = max(ans[cur], w); 

        for(auto e: v[cur]) {
            if(w * e.se > P[e.fi-1] || vis.find(mp(e.fi, w * e.se)) != vis.end())
                continue; 
            q.push(mp(e.fi, w * e.se)); 
        }
    }

    // for(int i = 1; i <= n; i++) {
    //     cout << ans[i] << " "; 
    // }
    cout << ans[n] << "\n"; 

}

int32_t main() {
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);

    int qq; 
    cin >> qq; 
    while(qq--) {
        test_case(); 
    }

    return 0;
}