#include<cstdio>
#include<vector>
#include<cstring>
#include<algorithm>
#include<cstdlib>
#include<cctype>
using namespace std;
void read(int &x){char ch;while(ch=getchar(),!isdigit(ch));x=ch-'0';while(ch=getchar(),isdigit(ch))x=x*10+ch-'0';
}
const int maxn=200005;
vector<int> num[maxn];
int n,m;
int h[maxn];
int l[maxn],r[maxn];
int x[maxn],y[maxn],typ[maxn];
int binary(int *stk,int l,int r,int x){while(l<=r){int mid=(l+r)>>1;if(h[stk[mid]]>=x)l=mid+1;else r=mid-1;}return stk[l-1];
}
void init(){static int stk[maxn],top=0;top=0;for(int i=1;i<=n;++i){num[i].clear();}for(int i=1;i<=m;++i){if(typ[i]==1)num[x[i]].push_back(i);}stk[top++]=0;for(int i=1;i<=n;++i){for(vector<int>::iterator pt=num[i].begin();pt!=num[i].end();++pt){l[(*pt)]=binary(stk,0,top-1,y[*pt]+1);}while(h[stk[top-1]]<h[i]){top--;}stk[top++]=i;}top=0;stk[top++]=n;for(int i=n;i>=1;--i){for(vector<int>::iterator pt=num[i].begin();pt!=num[i].end();++pt){r[*pt]=binary(stk,0,top-1,y[*pt]+1);}while(h[stk[top-1]]<h[i-1]){top--;}stk[top++]=i-1;}
}
int sum[maxn];//sum[i]:limitation i of typ1 contain how many limatation of typ0
int c[maxn];
void add(int x){for(;x<maxn;x+=x&(-x))c[x]++;
}
int pre(int x){int ans=0;for(;x;x-=x&(-x))ans+=c[x];return ans;
}
int seq[maxn];
bool cmp(const int &a,const int &b){return (y[a]==y[b])?typ[a]<typ[b]:y[a]<y[b];
}
struct edge{int to,next;
}lst[maxn<<1];int first[maxn],len=1;
void addedge(int a,int b){lst[len].to=b;lst[len].next=first[a];first[a]=len++;
}
struct node{int l,r,num,ord,sz;node* ch[2];node(){}node(int L,int R,int N){ch[0]=ch[1]=0;l=L;r=R;num=N;ord=rand();sz=1;}void update(){sz=1;if(ch[0])sz+=ch[0]->sz;if(ch[1])sz+=ch[1]->sz;}
}t[maxn*2];int tsz=0;
node* newnode(int L,int R,int x){t[++tsz]=node(L,R,x);return t+tsz;
}
void rot(node* &rt,int t){node* c=rt->ch[t];rt->ch[t]=c->ch[t^1];c->ch[t^1]=rt;rt=c;c->ch[t^1]->update();c->update();
}
void Insert(node* &rt,int x){if(!rt)rt=newnode(l[x]+1,r[x],x);else{int t=(l[x]+1)>rt->l;Insert(rt->ch[t],x);rt->update();if(rt->ch[t]->ord>rt->ord)rot(rt,t);}
}
node* succ(node* rt,int x){if(!rt)return 0;if(rt->l>=l[x]+1){node* tmp=succ(rt->ch[0],x);if(tmp)return tmp;else return rt;}else{return succ(rt->ch[1],x);}
}
node* root;
void remove(node* &rt,int l){if(rt->l!=l){remove(rt->ch[l>rt->l],l);rt->update();}else{if(!rt->ch[0])rt=rt->ch[1];else if(!rt->ch[1])rt=rt->ch[0];else{if(rt->ch[0]->ord>rt->ch[1]->ord){rot(rt,0);remove(rt->ch[1],l);}else{rot(rt,1);remove(rt->ch[0],l);}rt->update();}}
}
void traverse(node* rt){if(!rt)return;addedge(0,rt->num);traverse(rt->ch[0]);traverse(rt->ch[1]);
}
int sz[maxn],f[maxn];
void dp(int x){if(x)sz[x]=1;else sz[x]=0;int tmp=0;for(int pt=first[x];pt;pt=lst[pt].next){dp(lst[pt].to);sz[x]+=sz[lst[pt].to];tmp+=max(f[lst[pt].to],0);}f[x]=max(tmp,sz[x]-sum[x]);
}
int main(){int cases=0;int tests;read(tests);while(tests--){root=0;tsz=0;memset(c,0,sizeof(c));memset(first,0,sizeof(first));len=1;read(n);read(m);int cnt0=0;for(int i=1;i<n;++i)scanf("%d",&h[i]);for(int i=1;i<=m;++i){read(x[i]);read(y[i]);read(typ[i]);if(typ[i]==0)cnt0++;}h[0]=h[n]=0x7f7f7f7f;init();for(int i=1;i<=m;++i)seq[i]=i;sort(seq+1,seq+m+1,cmp);for(int i=1;i<=m;++i){if(typ[seq[i]]==0)add(x[seq[i]]);else{sum[seq[i]]=pre(r[seq[i]])-pre(l[seq[i]]);node* pt;while((pt=succ(root,seq[i]))&&pt->r<=r[seq[i]]){addedge(seq[i],pt->num);remove(root,pt->l);}Insert(root,seq[i]);}}sum[0]=pre(n);traverse(root);dp(0);printf("Case #%d: %d\n",++cases,cnt0+f[0]);}return 0;
}