#include <iostream>
#include <vector>
#include <set>
#include <queue>
#include <stack>
#include <math.h>
#include <cassert>
#include <bitset>
#include <map>
#include <algorithm>
#include <iterator>
#include <string>
#include <utility>
#include <numeric>
#include <regex>
#include <complex>
#include <random>
#include <atcoder/all>
using namespace atcoder;
using namespace std;
using ll=long long;
using ull=unsigned long long;
using P=pair<ll,ll>;
template<typename T>using minque=priority_queue<T,vector<T>,greater<T>>;
template<typename T>bool chmax(T &a,const T &b){return (a<b?(a=b,true):false);}
template<typename T>bool chmin(T &a,const T &b){return (a>b?(a=b,true):false);}
template<typename T1,typename T2>
ostream &operator<<(ostream &os,const pair<T1,T2>&p){
  os<<p.first<<" "<<p.second;
  return os;
}
template<typename T1,typename T2>
istream &operator>>(istream &is,pair<T1,T2>&p){
  is>>p.first>>p.second;
  return is;
}
template<typename T>
istream &operator>>(istream &is,vector<T> &a){
  for(auto &i:a)is>>i;
  return is;
}
#define reps(i,a,n) for(int i=(a);i<(n);i++)
#define rep(i,n) reps(i,0,n)
#define all(x) x.begin(),x.end()
ll myceil(ll a,ll b){return (a+b-1)/b;}
int main(){
  int n,m,x;
  cin>>n>>m>>x;
  vector<vector<int>>c(5,vector<int>(n,0));
  rep(i,n){
    int C;
    cin>>C;
    c[C-1][i]=1;
  }
  vector<vector<int>>p(5,vector<int>(n,0));
  rep(i,m){
    int a,b,y;
    cin>>a>>b>>y;
    a--,b--;
    p[b][a]+=y;
  }
  int ans=0;
  rep(i,5)reverse(all(p[i]));
  vector<vector<int>>cov(5);
  rep(i,5)cov[i]=convolution(c[i],p[i]);
  rep(i,n){
    int cu=0;
    rep(j,5){
      cu+=cov[j][n+i-1];
    }
    chmax(ans,cu+i*x);
  }
  chmax(ans,n*x);
  cout<<ans<<endl;
}