#include<bits/stdc++.h>
using namespace std;
using ll = long long;

#include<atcoder/modint>
#include<atcoder/convolution>
using mint = atcoder::modint998244353;
#define conv(a,b) atcoder::convolution(a,b)
ostream& operator<<(ostream& os, const mint& m){
    os << m.val();
    return os;
}

template < typename mint >
struct FPS:vector<mint>{
    FPS(int n){
       this->resize(n);
    }
    FPS(vector<mint>a){
        *this = a;
    }
    FPS &operator+=(const FPS&r){
        if(r.size()>this->size()) this->resize(r.size());
        for(int i = 0;i<(int)r.size();i++) (*this)[i] += r[i];
        return *this;
    }
    FPS &operator+=(const mint&r){
        if(this->empty()) this->resize(1);
        (*this)[0] += r;
        return *this;
    }
    FPS &operator*=(const FPS&r){
        vector<mint> nxt = conv(*this,r);
        this->resize(nxt.size());
        for(int i = 0;i<nxt.size();i++) (*this)[i] = nxt[i];
        return *this;
    }
    FPS &operator*=(const mint&r){
        for(int i = 0;i<(int)this->size();i++) (*this)[i] *= r;
        return *this;
    }
    FPS operator+(const FPS&r) const {return FPS(*this)+=r;}
    FPS operator+(const mint&r) const {return FPS(*this)+=r;}
    FPS operator*(const FPS&r) const {return FPS(*this)*=r;}

    void print(){
        for(int i = 0;i<(int)this->size();i++){
            if(i) cout<<" ";
            cout<<(*this)[i];
        }
        cout<<endl;
    }
};

template < typename mint >
FPS<mint> pow(FPS<mint>&a,ll k,int n){
    FPS<mint> ans(n+1);
    ans[0] += 1;
    FPS<mint> tmp = a;
    tmp.resize(n+1);
    while(k){
        if(k&1){
            ans *= tmp;
            ans.resize(n+1);
        }
        tmp *= tmp;
        tmp.resize(n+1);
        k>>=1;
    }
    return ans;
}
int main(){
    int n,m,x;
    cin>>n>>m>>x;
    vector<int> c(n);
    for(int i = 0;i<n;i++) cin>>c[i];
    vector<ll> a(m),b(m),y(m);
    for(int i = 0;i<m;i++) cin>>a[i]>>b[i]>>y[i];
    vector<FPS<mint>> f(5,FPS<mint>(n+1));
    for(int i = 0;i<n;i++){
        c[i]--;
        f[c[i]][i] = mint::raw(1);
    }
    vector<FPS<mint>> g(5,FPS<mint>(n+1));
    for(int i = 0;i<m;i++){
        b[i]--;
        a[i]--;
        g[b[i]][n-a[i]] += mint::raw(y[i]);
    }
    FPS<mint> ans(n+1);
    for(int i = 0;i<=n;i++){
        ans[i] = mint(i*x);
    }
    for(int i = 0;i<5;i++){
        FPS<mint> now = g[i] * f[i];
        for(int j = 0;j<=n;j++){
            ans[j] += now[j+n];
        }
    }
    int aa = 0;
    for(int i = 0;i<=n;i++) aa = max<int>(aa,ans[i].val());
    cout<<aa<<endl;


}