#include <iostream>

 #include <cstring>

 #include <cstdio>

 #include <cstdlib>

 #include <cmath>

 #include <cctype>

 #include <algorithm>

 #include <numeric>

 #include <limits.h>

 #define typec int

 using namespace std;

 const typec inf = 0xffff;

 const int V = ;

 int vis[V]; typec lowc[V];

 int Map[V][V];

 typec prim (typec cost[][V], int n) {

     int i, j, p;

     typec minc, res = ;

     memset(vis, , sizeof(vis));

     vis[] = ;

     for (i = ; i < n; ++ i) lowc[i] = cost[][i];

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

         minc = inf;

         p = -;

         for (j = ; j < n; ++ j) {

             if ( == vis[j] && minc > lowc[j]) {

                 minc = lowc[j];

                 p = j;

             }

         }

         if (inf == minc) return -;

         res += minc;

         vis[p] = ;

         for (j = ; j < n; ++ j) {

             if ( == vis[j] && lowc[j] > cost[p][j]) {

                 lowc[j] = cost[p][j];

             }

         }

     }

     return res;

 }

 int main () {

     int n, road_n, union_n, T;

     scanf("%d", &T);

     while (T--) {

         scanf("%d%d%d", &n, &road_n, &union_n);

         //cout << "road_n : "  << road_n << endl;

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

             for (int j = ; j < V; ++ j) {

                 if (i == j) Map[i][j] = ;

                 else Map[i][j] = inf;

             }

         }

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

             int x, y, w;

             scanf("%d%d%d", &x, &y, &w);

             Map[x - ][y - ] = Map[y - ][x - ] = min(Map[x - ][y - ], w);

         }

         /*

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

             for (int j = 0; j < n; ++ j) {

                 cout << Map[i][j] << "\t";

             }

             cout << endl;

         }

         */

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

             int xx, xx_n, last;

             scanf("%d", &xx_n);

             for (int j = ; j < xx_n; ++ j) {

                 scanf("%d", &xx);

                 if (!j) {

                     last = xx;

                     continue;

                 } else {

                     Map[xx - ][last - ] = Map[last - ][xx - ] = ;

                     last = xx;

                 }

             }

         }

         printf("%d\n", prim(Map, n));

     }

     return ;

 }