#include <bits/stdc++.h>
using namespace std;
#define FOR(i,m,n) for(int i=(m);i<(n);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(),(v).end()
using ll = long long;
constexpr int INF = 0x3f3f3f3f;
constexpr long long LINF = 0x3f3f3f3f3f3f3f3fLL;
constexpr double EPS = 1e-8;
constexpr int MOD = 998244353;
// constexpr int MOD = 1000000007;
constexpr int DY4[]{1, 0, -1, 0}, DX4[]{0, -1, 0, 1};
constexpr int DY8[]{1, 1, 0, -1, -1, -1, 0, 1};
constexpr int DX8[]{0, -1, -1, -1, 0, 1, 1, 1};
template <typename T, typename U>
inline bool chmax(T& a, U b) { return a < b ? (a = b, true) : false; }
template <typename T, typename U>
inline bool chmin(T& a, U b) { return a > b ? (a = b, true) : false; }
struct IOSetup {
  IOSetup() {
    std::cin.tie(nullptr);
    std::ios_base::sync_with_stdio(false);
    std::cout << fixed << setprecision(20);
  }
} iosetup;

#include <atcoder/convolution>

int main() {
  constexpr int C = 5;
  int n, m, x; cin >> n >> m >> x;
  vector<int> c(n); REP(i, n) cin >> c[i], --c[i];
  array<vector<pair<int, int>>, C> bonus{};
  while (m--) {
    int a, b, y; cin >> a >> b >> y; --a; --b;
    bonus[b].emplace_back(a, y);
  }
  vector<ll> scores(n + 1, 0);
  REP(i, n + 1) scores[i] = ll{x} * i;
  REP(color, C) {
    vector<ll> v1(n, 0);
    REP(i, n) {
      if (c[i] == color) v1[i] = 1;
    }
    vector<ll> v2(n + 1, 0);
    for (const auto& [a, y] : bonus[color]) v2[n - a] += y;
    const vector<ll> v = atcoder::convolution_ll(v1, v2);
    REP(i, n + 1) scores[i] += v[n + i];
  }
  cout << *ranges::max_element(scores) << '\n';
  return 0;
}