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
136
137
138
#include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdlib>
#include <ctime>
#include <deque>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_set>
#include <vector>

using namespace std;

#define JOIN_(X, Y) X##Y
#define JOIN(X, Y) JOIN_(X, Y)
#define TMP JOIN(tmp, __LINE__)
#define PB push_back
#define SZ(x) int((x).size())
#define REP(i, n) for (int i = 0, TMP = (n); i < TMP; ++i)
#define FOR(i, a, b) for (int i = (a), TMP = (b); i <= TMP; ++i)
#define FORD(i, a, b) for (int i = (a), TMP = (b); i >= TMP; --i)

#ifdef DEBUG
#define DEB(x) (cerr << x)
#else
#define DEB(x)
#endif

template <typename S, typename T> ostream &operator<<(ostream &os, const pair<S, T> &p) {
    os << "(" << p.first << ", " << p.second << ")";
    return os;
}

template <typename T> ostream &operator<<(ostream &os, const vector<T> &vec) {
    os << "[";
    for (int i = 0; i < SZ(vec); ++i) {
        os << vec[i];
        if (i != SZ(vec) - 1) {
            os << ", ";
        }
    }
    os << "]";
    return os;
}

typedef long long ll;
typedef vector<int> vi;
// typedef pair<int, int> pii;
// typedef unsigned int uint;
typedef unordered_set<int> uset;

const int INF = 1e9 + 9;

struct Edge {
    int target;
    ll multiplier;
};

struct Case {
    vector<vector<Edge>> adj;
    vector<uset> states;
    vector<ll> limits;

    void dfs(int x, ll signal) {
        states[x].insert(signal);
        for (const auto &[y, multiplier] : adj[x]) {
            ll new_signal = signal * multiplier;
            if (new_signal <= limits[y]) {
                if (not states[y].count(new_signal)) {
                    dfs(y, new_signal);
                }
            }
        }
    }

    void solve() {
        DEB("========================\n");
        int n, m;
        cin >> n >> m;
        DEB("NEW CASE n=" << n << ", m=" << m << "\n");

        limits.resize(n + 1);
        FOR(i, 1, n) { cin >> limits[i]; }

        set<tuple<int, int, ll>> unique_edges;

        adj.resize(n + 1);
        REP(i, m) {
            int a, b;
            ll multiplier;
            cin >> a >> b >> multiplier;
            unique_edges.emplace(a, b, multiplier);
            // adj[a].emplace_back(b, multiplier);
        }

        for (const auto &[a, b, multiplier] : unique_edges) {
            adj[a].emplace_back(b, multiplier);
        }

        states.resize(n + 1);
        DEB("before dfs\n");
        dfs(1, 1);
        DEB("afters dfs\n");

        FOR(i, 1, n) {
            DEB("states for i=" << i << "\n");
            DEB("  size=" << SZ(states[i]) << "\n");
            // vi s(states[i].begin(), states[i].end());
            // sort(s.begin(), s.end());
            // DEB("  " << s << "\n");
        }

        int result = -1;
        for (const auto &signal : states[n]) {
            result = max(result, signal);
        }
        cout << result << "\n";
        DEB("\n\n");
    }
};

void inline one() {}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    int z;
    cin >> z;
    DEB("z=" << z << "\n");
    while (z--) {
        Case().solve();
    }
}