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

typedef int64_t ll;
typedef uint64_t ull;
typedef unsigned int ui;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<long long> vll;
constexpr ll LINF = 1e18;
constexpr int INF = 1e9;

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int t;
    cin >> t;

    while (t--) {
        int n, m;
        cin >> n >> m;

        vector<vector<pii>> g(n + 1);
        vi p(n + 1);
        for (int i = 1; i <= n; ++i) {
            cin >> p[i];
        }

        for (int i = 0; i < m; ++i) {
            int a, b, w;
            cin >> a >> b >> w;

            g[a].push_back({b, w});
        }

        queue<pair<int, ll>> q;
        q.push({1, 1});

        ll best = -1;
        vector<unordered_set<int>> visited_powers(n + 1);
        visited_powers[1].insert(1);
        while (!q.empty()) {
            auto path = q.front();
            q.pop();

            int v = path.first;
            ll power = path.second;

            if (v == n) {
                best = max(power, best);
            }

            for (size_t i = 0; i < g[v].size(); ++i) {
                int next = g[v][i].first;
                ll next_power = power * g[v][i].second;

                if (next_power <= p[next] && !visited_powers[next].count(next_power)) {
                    q.push({next, next_power});
                }
            }
        }

        cout << best << endl;
    }

    return 0;
}