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

#define all(x) begin(x),end(x)
#define pb push_back
#define st first
#define nd second

typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;

const int INF = 2e9;
const ll LLINF = 2e18;

void bfs(const vector<vector<pii>>& G, vll& minVal)
{
    priority_queue<pll,vector<pll>,greater<pll>> q;
    q.push({1,0});
    minVal[0]=1;
    while(!q.empty())
    {
        auto[c,v]=q.top(); q.pop();
        if(c!=minVal[v])
            continue;
        for(auto[u,w]: G[v])
            if(minVal[u]>c*(ll)w)
            {
                minVal[u]=c*(ll)w;
                q.push({minVal[u],(ll)u});
            }
    }
}

void dfs(const vector<vector<pii>>& G, vll& mx, vector<set<ll>>& tested, const vll& p, int v, ll c)
{
    if(c>p[v] || tested[v].contains(c))
        return;
    mx[v]=max(mx[v],c);
    tested[v].insert(c);
    for(auto[u,w]: G[v])
        dfs(G,mx,tested,p,u,c*(ll)w);
}

void solve()
{
    int n,m;
    scanf("%d%d",&n,&m);
    vll p(n);
    for(auto& x:p)
        scanf("%lld",&x);
    vector<vector<pii>> G(n);
    for(int i=0; i<m; ++i)
    {
        int a,b,w;
        scanf("%d%d%d",&a,&b,&w);
        bool exists=false;
        for(auto e:G[a-1])
            if(e.st==b-1 && e.nd==w)
            {
                exists=true;
                break;
            }
        if(!exists)
            G[a-1].pb({b-1,w});
    }

    vll minVal(n,INF);
    bfs(G,minVal);
    if(minVal[n-1]>p[n-1])
    {
        printf("-1\n");
        return;
    }

    vll mx(n,-1);
    vector<set<ll>> tested(n);
    dfs(G,mx,tested,p,0,1);
    printf("%lld\n",mx[n-1]);
}

int main()
{
    int z;
    scanf("%d",&z);
    while(z--)
        solve();
    return 0;
}