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
// Witold Milewski
// PA 2025
#include <bits/stdc++.h>
// #define int long long
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
#define i128 __int128_t
using namespace std;
#define FOR(i, a, b) for(int i=a; i<=b; ++i)
#define FORB(i, b, a) for(int i=b; i>=a; --i)
#define sz(A) (int)(A.size())
#define ll long long
#define eb emplace_back
#define pb push_back
#define pi pair<int, int>
#define f first
#define s second
#define rs resize
#define V vector



int n, m;
V<int> A;
V<V<pi>> con;

void solve() {
  cin >> n >> m;
  V<gp_hash_table<int, bool>> vis(n+1);
  vis[1][1]=1;
  A.rs(n+1);
  con.clear();
  con.rs(n+1);
  FOR(i, 1, n) cin >> A[i];
  int a, b, w;
  FOR(i, 1, m) {
    cin >> a >> b >> w;
    con[a].pb({b, w});
  }

  ll wyn=-1;
  if(n==1) wyn=1;
  queue<pi> paths;
  paths.push({1, 1});
  while(!paths.empty()) {
    auto [v, w] = paths.front();
    paths.pop();

    for(auto &[u, krwag] : con[v]) {
      ll nw = 1ll*w*krwag;
      if(A[u]<nw || vis[u].find(nw)!=vis[u].end()) continue;
      if(u==n) wyn=max(wyn, nw);
      vis[u][nw]=1;
      paths.push({u, nw});
    }
  }

  cout << wyn << '\n';
}

signed main() {
  cin.tie(0) -> ios_base::sync_with_stdio(0);
  int q; cin >> q;
  while(q--) solve();
}