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
#include <cstdlib>
#include <bitset>
#include <functional>
#include <utility>
#include <chrono>
#include <tuple>
#include <new>
#include <memory>
#include <climits>
#include <cfloat>
#include <cinttypes>
#include <exception>
#include <string>
#include <array>
#include <vector>
#include <deque>
#include <list>
#include <forward_list>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <stack>
#include <queue>
#include <algorithm>
#include <iterator>
#include <cmath>
#include <complex>
#include <valarray>
#include <ios>
#include <istream>
#include <ostream>
#include <iostream>
#include <fstream>
#include <streambuf>
#include <cstdio>
#include <thread>
// #include <bits/stdc++.h>
using namespace std;

int q;
int n, m;
long long przepustowosc[105], maksimum;
int a, b;
long long mnoznik, akt_mnoznik;

vector<pair<int, long long>> graf[105];
map<long long, bool> dodane[105];
queue<pair<int, long long>> Q; // wierz, akt_mnoznik
int main()
{
    std::ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);

    cin >> q;
    while (q--)
    {
        cin >> n >> m;
        for (int i = 1; i <= n; i++)
        {
            cin >> przepustowosc[i];
            graf[i].clear();
            dodane[i].clear();
        }
        maksimum = przepustowosc[n];

        for (int i = 1; i <= m; i++)
        {
            cin >> a >> b >> mnoznik;
            graf[a].push_back({b, mnoznik});
            graf[b].push_back({a, mnoznik});
        }

        Q.push({1, 1});
        dodane[1][1] = 1;
        while (!Q.empty())
        {
            tie(a, akt_mnoznik) = Q.front();
            Q.pop();

            for (auto para : graf[a])
            {
                tie(b, mnoznik) = para;
                mnoznik = akt_mnoznik * mnoznik;

                if (mnoznik > maksimum || dodane[b][mnoznik] == 1 || mnoznik > przepustowosc[b])
                    continue;

                dodane[b][mnoznik] = 1;
                Q.push({b, mnoznik});
            }
        }

        if (dodane[n].empty())
            cout << -1 << "\n";
        else
            cout << dodane[n].rbegin()->first << "\n";
    }
}