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
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>

#define pb push_back
#define pob pop_back
#define eb emplace_back
#define fi first
#define se second
#define turbo ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define mid ((l+r)/2)
#define midLL ((l+r)/2LL)
#define mide ((lo+hi)/2)
#define mideLL ((lo+hi)/2LL)
#define endl '\n'
#define shandom_ruffle random_shuffle
#define lowbit(x) x&(-x)
#define bits(x) __builtin_popcount(x) 
#define mins(se) (*se.begin())
#define maxs(se) (*--se.end())
#define all(x) x.begin(), x.end()
#define log2_floor(i) (i ? __builtin_clzll(1) - __builtin_clzll(i) : -1)
#define siz(cont) ((int)cont.size())
#define each(it, cont) for(auto &it : cont)

using ll = long long;
using pii = std::pair<int, int>;
using pll = std::pair<ll, ll>;
using pli = std::pair<ll, int>;
using pil = std::pair<int, ll>;
using vll = std::vector<pll>;
using vii = std::vector<pii>;
using vi = std::vector<int>;
using vl = std::vector<ll>;
using vvl = std::vector<vl>;
using vvi = std::vector<vi>;
using vvii = std::vector<vii>;
using vli = std::vector<pli>;
using vvli = std::vector<vli>;
using vvll = std::vector<vll>;
using vil = std::vector<pil>;
using vvil = std::vector<vil>;
using vc = std::vector<char>;
using vvc = std::vector<std::vector<char>>;
using vb = std::vector<bool>;
using vvb = std::vector<vb>;

void err() { std::cout << "\n"; fflush(stdout); }
template<class T, class... Ts>
void err(T arg, Ts &... args) {
    std::cout << arg << ' ';
    err(args...);
}

using namespace std;
using namespace __gnu_pbds;

struct pair_hash {
    template <class T1, class T2>
    size_t operator()(const pair<T1, T2>& p) const {
        return hash<T1>()(p.fi) ^ (hash<T2>()(p.se) << 1);
    }
};

ll n, m;
vl v;
vvil g;

gp_hash_table<pil, null_type, pair_hash> vis;

bool contains(pil it) {
    return vis.find(it) != vis.end();
}

ll res;

struct senko{
    int e, i;
    ll prod;
};

stack<senko> st;

void dfs() {
    st.push({0, 0, 1});
    while (!st.empty()) {
        auto &it = st.top();
        vis.insert({it.e, it.prod});
        if (it.e == n-1)
            res = max(res, it.prod);
        bool skip = false;
        for (int i = it.i; i < siz(g[it.e]); i++) {
            auto [b, w] = g[it.e][i];
            if (it.prod*w <= v[b] and !contains({b, it.prod*w})) {
                it.i++;
                st.push({b, 0, w*it.prod});
                skip = true;
                break;
            }
        }
        if (!skip)
            st.pop();
    }
}

void solve() {
    res = -1;
    vis.clear();
    cin >> n >> m;
    v = vl(n);
    g = vvil(n);
    each(it, v)
        cin >> it;

    while(m--) {
        ll a, b, w;
        cin >> a >> b >> w;
        a--, b--;
        g[a].pb({b, w});
    }

    mt19937 gg(420);

    each(it, g)
         shuffle(all(it), gg);

    dfs();
    cout << res << endl;
}

signed main() { 
    turbo;
    int tt; cin >> tt;
    while (tt--)
        solve();
}