#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
//using mint = modint1000000007;
//const int mod = 1000000007;
using mint = modint998244353;
const int mod = 998244353;
//const int INF = 1e9;
//const long long LINF = 1e18;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i,l,r)for(int i=(l);i<(r);++i)
#define rrep(i, n) for (int i = (n-1); i >= 0; --i)
#define rrep2(i,l,r)for(int i=(r-1);i>=(l);--i)
#define all(x) (x).begin(),(x).end()
#define allR(x) (x).rbegin(),(x).rend()
#define endl "\n"
#define P pair<int,int>
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }

int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	int n, m, x; cin >> n >> m >> x;
	vector c(5, vector<mint>(n, 0));
	rep(i, n) {
		int _c; cin >> _c;
		c[_c - 1][i] = 1;
	}
	rep(i, 5)reverse(all(c[i]));
	vector f(5, vector<mint>(n, 0));
	rep(i, m) {
		int a, b, y; cin >> a >> b >> y;
		a--, b--;
		f[b][a] += y;
	}
	rep(i, 5)f[i] = convolution(f[i], c[i]);
	int ans = x * n;
	rep(i, n) {
		int val = 0;
		rep(j, 5)val += f[j][i].val();
		val += (n - 1 - i)*x;
		chmax(ans, val);
	}
	cout << ans << endl;
	return 0;
}