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
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
#include <bits/stdc++.h>
#define MP make_pair
#define PB push_back
#define int long long
#define st first
#define nd second
#define rd third
#define FOR(i, a, b) for(int i =(a); i <=(b); ++i)
#define RE(i, n) FOR(i, 1, n)
#define FORD(i, a, b) for(int i = (a); i >= (b); --i)
#define REP(i, n) for(int i = 0;i <(n); ++i)
#define ALL(x) (x).begin(), (x).end()
#define SZ(x) ((int)(x).size())
#define __builtin_ctz __builtin_ctzll
#define __builtin_clz __builtin_clzll
#define __builtin_popcount __builtin_popcountll
using namespace std;
template<class T1, class T2>
ostream& operator<< (ostream &out, pair<T1, T2> pair) { return out << "(" << pair.first << ", " << pair.second << ")";}
template<class A, class B, class C> struct Triple { A first; B second; C third;
  bool operator<(const Triple& t) const { if (st != t.st) return st < t.st; if (nd != t.nd) return nd < t.nd; return rd < t.rd; } };
  template<class T> void ResizeVec(T&, vector<int>) {}
  template<class T> void ResizeVec(vector<T>& vec, vector<int> sz) {
    vec.resize(sz[0]); sz.erase(sz.begin()); if (sz.empty()) { return; }
    for (T& v : vec) { ResizeVec(v, sz); }
  }
  typedef Triple<int, int, int> TIII;
  template<class A, class B, class C>
  ostream& operator<< (ostream &out, Triple<A, B, C> t) { return out << "(" << t.st << ", " << t.nd << ", " << t.rd << ")"; }
  template<class T> ostream& operator<<(ostream& out, vector<T> vec) { out<<"("; for (auto& v: vec) out<<v<<", "; return out<<")"; }
  template<class T> ostream& operator<<(ostream& out, set<T> vec) { out<<"("; for (auto& v: vec) out<<v<<", "; return out<<")"; }
  template<class L, class R> ostream& operator<<(ostream& out, map<L, R> vec) { out<<"("; for (auto& v: vec) out<<v<<", "; return out<<")"; }
  
template<typename TH> void _dbg(const char* sdbg, TH h) { cerr<<sdbg<<"="<<h<<"\n"; }
template<typename TH, typename... TA> void _dbg(const char* sdbg, TH h, TA... t) {
  while(*sdbg != ',') { cerr<<*sdbg++; } cerr<<"="<<h<<","; _dbg(sdbg+1, t...);
}
#ifdef LOCAL
#define debug(...) _dbg(#__VA_ARGS__, __VA_ARGS__)
#else
#define debug(...) (__VA_ARGS__)
#define cerr if(0)cout
#endif
typedef long double LD;
typedef pair<int, int> PII;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<pair<int, int> > VPII;

template<class C> void mini(C&a4, C b4){a4=min(a4, b4); }
template<class C> void maxi(C&a4, C b4){a4=max(a4, b4); }

mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
//mt19937 rng(57);
#define rand fgfdgfdgfd

struct Edge {
  int nei, w;
};

const int A = 1e5 + 5;
const int B = 1e4 + 5;
int prefn, prefm;
struct Sol {
  void Test(int tescior) {
    int n, m;
    cin>>n>>m;
    prefn += n;
    prefm += m;
    if (tescior % 100 == 0) {
      debug(tescior, prefn, prefm);
    }
    vector<VI> forw1(n + 2);
    vector<VI> backw1(n + 2);
    vector<vector<Edge>> forw2(n + 2);
    vector<vector<Edge>> backw2(n + 2);
    VI cap(n + 2);
    RE (i, n) {
      cin>>cap[i];
    }
    RE (i, m) {
      int a, b, w;
      cin>>a>>b>>w;
      if (w == 1) {
        forw1[a].PB(b);
        backw1[b].PB(a);
      } else {
        forw2[a].PB({b, w});
        backw2[b].PB({a, w});
      }
    }
    vector<VI> get_to(n + 2, VI(A + 2));
    get_to[1][1] = 1;
    RE (val, A) {
      function<void(int)> Dfs = [&](int v) {
        get_to[v][val] = 1;
        for (auto nei : forw1[v]) {
          if (cap[nei] < val) { continue; }
          if (get_to[nei][val]) { continue; }
          Dfs(nei);
        }
      };
      RE (v, n) {
        if (get_to[v][val]) {
          Dfs(v);
        }
      }
      RE (v, n) {
        if (get_to[v][val] == 0) { continue; }
        for (auto e : forw2[v]) {
          int nval = val * e.w;
          if (nval <= min(A, cap[e.nei])) {
            get_to[e.nei][nval] = 1;
          }
        }
      }
    }
    vector<VI> get_from(n + 2, VI(B + 2));
    get_from[n][1] = cap[n];
    vector<int> ord;
    RE (i, n) {
      ord.PB(i);
    }
    RE (val, B) {
      //sort(ALL(ord), [&](int a, int b) { return get_from[a][val] > get_from[b][val]; });
      // function<void(int)> Dfs = [&](int v) {
      //   for (auto nei : backw1[v]) {
      //     if (get_from[nei][val] < get_from[v][val]) {
      //       get_from[nei][val] = get_from[v][val];
      //       Dfs(nei);
      //     }
      //   }
      // };
      // for (auto v : ord) {
      //   Dfs(v);
      // }
      // TODO !!!!!!!!
      set<PII> que;
      RE (v, n) {
        if (SZ(backw1[v])) {
          que.insert({-get_from[v][val], v});
        }
      }
      while (SZ(que)) {
        auto p = *que.begin();
        que.erase(que.begin());
        for (auto nei : backw1[p.nd]) {
          int cand = min(-p.st, cap[nei]);
          if (cand > get_from[nei][val]) {
            que.erase({-get_from[nei][val], nei});
            get_from[nei][val] = cand;
            que.insert({-get_from[nei][val], nei});
          }
        }
      }
      RE (v, n) {
        for (auto e : backw2[v]) {
          int nval = val * e.w;
          if (nval <= B) {
            maxi(get_from[e.nei][nval], min(get_from[v][val] / e.w, cap[e.nei]));
          }
        }
      }
    }
    RE (v, n) {
      RE (val, A) {
        if (get_to[v][val]) {
          get_to[v][val] = val;
        } else {
          get_to[v][val] = get_to[v][val - 1];
        }
      }
    }
    int best = 0;
    if (get_to[n][1]) {
      best = 1;
    }
    RE (v, n) {
      RE (val, B) {
        for (auto e : backw2[v]) {
          int heh = get_to[e.nei][min(min(A, cap[e.nei]), get_from[v][val] / e.w)];
          assert(heh == get_to[e.nei][min(A, get_from[v][val] / e.w)]);
          int cand = heh * e.w * val;
          // if (cand > best) {
          //   debug(heh * e.w * val, heh, e.w, val);
          // }
          maxi(best, heh * e.w * val);
        }
      }
    }
    if (best == 0) {
      cout<<"-1\n";
    } else {
      cout<<best<<"\n";
    }
  }
};

int32_t main() {

  ios_base::sync_with_stdio(0);
  cout << fixed << setprecision(10);
  cerr << fixed << setprecision(10);
  cin.tie(0);
  //double beg_clock = 1.0 * clock() / CLOCKS_PER_SEC;
  
  int t;
  cin>>t;
  // t = 30;
  RE (i, t) {
    Sol sol;
    sol.Test(i);
  }
  
  
  
  
  
  
  
  
  
  
  
  
  
  
  
  
  
  
  
  
  
  
  
  
  
  return 0;
}