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
101
102
103
104
105
106
107
108
109
110
111
112
//
#ifndef __SIZEOF_INT128__
  #define __SIZEOF_INT128__
#endif
#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace chrono;
using namespace __gnu_pbds;
template <typename T> using oset =  tree<T, null_type, less_equal<T>, rb_tree_tag, tree_order_statistics_node_update>;
#define rep(i, p, k) for(int i(p); i < (k); ++i)
#define per(i, p, k) for(int i(p); i > (k); --i)
#define sz(x) (int)(x).size()
#define sc static_cast
typedef long long ll;
typedef long double ld;
typedef unsigned int uint;
typedef unsigned long long ull;
typedef __int128_t lll;
//#define int ll
template <typename T = int> using par = std::pair <T, T>;
#define fi first
#define se second
#define test int _number_of_tests(in()); while(_number_of_tests--)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define pb emplace_back
struct Timer {
    string name{""};
    time_point<high_resolution_clock> end, start{high_resolution_clock::now()};
    duration<float, std::milli> dur;
    Timer() = default;
    Timer(string nm): name(nm) {}
    ~Timer() {
        end = high_resolution_clock::now(); dur= end - start;
        cout << "@" << name << "> " << dur.count() << " ms" << '\n';
    }
};
template <typename T = int> inline T in()
{
    static T x;
    std::cin >> x;
    return x;
}
std::string yn(bool b)
{
    if(b) return "YES\n";
    else return "NO\n";
}
template <typename F, typename S> std::ostream& operator<<(std::ostream& out, const std::pair <F, S>& par);
template <typename T> std::ostream& operator<< (std::ostream& out, const std::vector <T>& wek)
{
    for(const auto& i : wek)out << i << ' ';
    return out;
}
template <typename F, typename S> std::ostream& operator<<(std::ostream& out, const std::pair <F, S>& par)
{
    out << '{'<<par.first<<", "<<par.second<<"}";
    return out;
}
#define show(x) cerr << #x << " = " << x << '\n';
constexpr int maxn = 103, spqr = 31630;
vector <pair <int, int>> graf[maxn], agraf[maxn];
int p[maxn];
int nl[maxn][spqr];
bool byl[maxn][spqr];
struct kul_t { int l, w, m; };
set <int> moz[maxn];
void dfs(int w, int s)
{
    if(moz[w].count(s))return;
    moz[w].insert(s);
    for(auto [i, j]: graf[w])if(ll(s)*j <= p[i] && s*j < spqr)dfs(i, s*j);
}
std::int32_t main()
{
    std::cout.tie(nullptr); //for luck
    std::cin.tie(nullptr); std::ios_base::sync_with_stdio(0);
    test{
        int n(in()), m(in()), a, b, c;
        rep(i, 0, n)rep(j, 0, spqr)byl[i][j] = nl[i][j] = 0;
        rep(i, 0, n)cin >> p[i];
        rep(i, 0, n){
            graf[i].clear();
            agraf[i].clear();
        }
        rep(i, 0, m){
            cin >> a >> b >> c;
            --a; --b;
            graf[a].pb(b, c);
            agraf[b].pb(a, c);
        }
        priority_queue <tuple <int, int, int>> kul;
        kul.push({p[n-1], n-1, 1});
        while(kul.size()){
            auto [l, w, s] = kul.top(); kul.pop();
            if(byl[w][s])continue;
            byl[w][s] = 1;
            nl[w][s] = l;
            for(auto [i, j]: agraf[w]) if(j <= l && s*j < spqr && !byl[i][s*j])kul.push({min(p[i], l/j), i, s*j});
        }
        rep(i, 0, n)moz[i].clear();
        dfs(0, 1);
        int o(n == 1 ? 1 : -1);
        rep(a, 0, n)for(auto [b, c]: graf[a])rep(s, 0, spqr)if(sz(moz[a]) && *moz[a].begin() <= nl[b][s]/c)
            o = max(o, *prev(moz[a].upper_bound(nl[b][s]/c))*c*s);
        cout << o << '\n';
    }
    return 0;
}