#include<bits/stdc++.h>
#include<atcoder/all>
using namespace std;
using namespace atcoder;

typedef modint998244353 mint;
typedef long long ll;

int main(){
	int n, m, x; cin >> n >> m >> x;
	vector<int> c(n);
	vector<vector<ll>> lst(5, vector<ll>(n));
	for (int i=0; i<n; i++){
		cin >> c[i];
		c[i]--;
		lst[c[i]][i] += 1;
	}

	vector<vector<ll>> bonus(5, vector<ll>(n));
	for (int i=0; i<m; i++){
		int a, b, y; cin >> a >> b >> y;
		a--; b--;
		bonus[b][a] += y;
	}
	for (int i=0; i<5; i++){
		reverse(lst[i].begin(), lst[i].end());
	}
	ll ans = n * x;
	vector<ll> qr(n);
	for (int i=0; i<n; i++){
		qr[i] = i * x;
	}
	for (int j=0; j<5; j++){
		vector<ll> ar = convolution_ll(lst[j], bonus[j]);
		for (int i=0; i<n; i++){
			qr[i] += ar[n-1-i];
		}
	}
	for (int i=0; i<n; i++){
		ans = max(ans, qr[i]);
	}
	cout << ans << endl;
}