#include <stdio.h>

 #include <string.h>

 #include <stdlib.h>

 #include <math.h>

 #include <iostream>

 #include <string>

 #include <iomanip>

 #include <vector>

 #include <queue>

 #include <algorithm>

 #define N 100000+10

 using namespace std;

 int n, m;

 struct nodea

 {

     int x, y;

     bool operator < (const nodea&dd)const

     {

         return x<dd.x;

     }

 }a[N];

 struct nodeb

 {

     int x, y;

     bool operator < (const nodeb&dd)const

     {

         return x<dd.x;

     }

 }b[N];

 int main()

 {

     int t;

     int i, j;

     scanf("%d", &t);

     while(t--)

     {

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

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

         {

             scanf("%d %d", &a[i].x, &a[i].y);

         }

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

         {

             scanf("%d %d", &b[i].x, &b[i].y);

         }

         sort(a, a+n);

         sort(b, b+m);

         long long int cnt=;

         long long int sum=;

         j=;

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

         {

             while(a[i].x > b[j].x && j<m )

             {

                 cnt+=b[j].y;

                 j++;

             }

             sum=sum+cnt*a[i].y;

             //printf("%lld---", sum );

         }

         printf("%lld\n", sum );

     }

     return ;

 }