#include <bits/stdc++.h>

 using namespace std;

 #define ll long long

 #define ull unsigned long long

 #define mst(a,b) memset((a),(b),sizeof(a))

 #define mp(a,b) make_pair(a,b)

 #define pi acos(-1)

 #define pii pair<int,int>

 #define pb push_back

 const int INF = 0x3f3f3f3f;

 const double eps = 1e-;

 const int MAXN = 1e5 + ;

 const int MAXM = 1e3 + ;

 int bx[MAXN],cntb[MAXN];

 struct node {

     int a,c,d;

     ll num;

     bool operator == (const node &x) {

         if(a == x.a && c == x.c && d == x.d) return true;

         return false;

     }

 }p[MAXN];

 bool cmp(node x,node y) {

     if(x.a != y.a) return x.a < y.a;

     else if(x.c != y.c) return x.c < y.c;

     else if(x.d != y.d) return x.d < y.d;

     return x.num < y.num;

 }

 int lowbit(int x) {

     return x & (-x);

 }

 ll bit[MAXM][MAXM];

 void update(int x,int y,ll val) {

     for(int i = x; i <= ; i+= lowbit(i))

         for(int j = y; j <= ; j += lowbit(j))

             bit[i][j] += val;

 }

 ll get(int x,int y) {

     ll ans = ;

     for(int i = x; i > ; i -= lowbit(i))

         for(int j = y; j > ; j -= lowbit(j))

             ans += bit[i][j];

     return ans;

 }

 ll query(int x1,int y1,int x2,int y2) {

     return get(x2,y2) - get(x1 - ,y2) - get(x2, y1 - ) + get(x1 - , y1 - );

 }

 int main() {

 #ifdef local

     freopen("data.txt", "r", stdin);

 #endif

     int cas = ;

     int t;

     scanf("%d", &t);

     while(t--) {

         mst(bx, );

         mst(cntb, );

         mst(bit, );

         int n,m;

         scanf("%d%d",&n,&m);

         for(int i = ; i <= n; i++) {

             int a,b;

             scanf("%d%d",&a,&b);

             if(a > bx[b]) bx[b] = a, cntb[b] = ;

             else if(a == bx[b]) cntb[b]++;

         }

         for(int i = ; i <= m; i++) {

             int c,d,e;

             scanf("%d%d%d",&c,&d,&e);

             p[i] = {bx[e],c,d,cntb[e]};

         }

         sort(p + , p +  + m, cmp);

         int tot = ;

         for(int i = ; i <= m; i++) {

             if(!p[i].num) continue;

             if(p[i] == p[tot]) p[tot].num += p[i].num;

             else p[++tot] = p[i];

         }

         ll ans = ;

         for(int i = tot; i >= ; i--) {

             if(!query(p[i].c,p[i].d,,)) ans += p[i].num;

             update(p[i].c,p[i].d,p[i].num);

         }

         printf("Case #%d: %lld\n",cas++,ans);

     }

     return ;

 }