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

using namespace std;

#define rep(i, a, b) for (int i = a; i < (b); ++i)
#define ALL(x) begin(x), end(x)
#define SZ(x) (int)(x).size()
#define st first
#define nd second
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<ll> vl;

#ifdef LOCAL
#define DTP(x, y)                                    \
    auto operator<<(auto &o, auto a)->decltype(y, o) \
    {                                                \
        o << "(";                                    \
        x;                                           \
        return o << ")";                             \
    }
DTP(o << a.first << ", " << a.second, a.second);
DTP(for (auto i : a) o << i << ", ", ALL(a));
void dump(auto... x) { ((cerr << x << ", "), ...) << '\n'; }
#define debug(x...) cerr << setw(4) << __LINE__ << ":[" #x "]: ", dump(x)
#else
#define debug(...) 42
#endif

void solve()
{
    int n, m;
    cin >> n >> m;
    vi P(n);
    for (auto &a : P)
        cin >> a;
    vector<vector<pii>> G(n);
    while (m--)
    {
        int a, b, c;
        cin >> a >> b >> c;
        G[b - 1].push_back({a - 1, c});
    }
    vector<map<int, int>> M(n);
    priority_queue<pair<int, pii>> Q;
    Q.push({P.back(), {P.back(), n - 1}});
    M.back()[P.back()] = P.back();
    int ans = -1;
    while (Q.size())
    {
        auto [a, b] = Q.top();
        // debug(a, b);
        Q.pop();
        if (!b.second)
        {
            ans = max(ans, a / b.first);
            if (b.first == 1)
                break;
        }
        if (a <= ans)
            break;
        if (M[b.second][b.first] > a)
            continue;
        for (auto &[x, y] : G[b.second])
        {
            int d = min(P[x], b.first / y);
            if (!d)
                continue;
            int val = d * (a / b.first) * y;
            auto a = M[x].find(d);
            if (a == M[x].end() || (*a).second < val)
            {
                Q.push({val, {d, x}});
                M[x][d] = val;
            }
        }
    }
    cout << ans << endl;
}

main()
{
    cin.tie(0)->sync_with_stdio(0);
    cin.exceptions(cin.failbit);

    int Z = 1;
    cin >> Z;
    while (Z--)
    {
        solve();
        // if (!(Z % 100))
        //     debug(Z);
    }
}