#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define sz(x) (int) (x).size()
#define endl '\n'
int main()
{
cin.tie(0) -> sync_with_stdio(0);
int n, m, k;
cin >> n >> m >> k;
int p[n+5]={}, sum=0;
bool f=0;
for(int i = 0;i < n-1;i++)
{
cin>> p[i];
if(p[i]!=i-1) f=1;
}
int a[n+5]={};
for(int i = 0;i < m;i++)
{
int v, d, w;
cin >> v >> d >> w;
a[v]=d;
sum+=w;
}
if(f) {cout << sum;return 0;}
vector<int> v;
for(int i = n;i>=1;i--)
{
if(a[i]==0) continue;
auto it=upper_bound(all(v), a[i]);
if(it==v.end()) v.pb(a[i]);
else *it=a[i];
}
cout << sz(v);
}
