#include<bits/stdc++.h>

 using namespace std;

 typedef long long ll;

 const int maxn =  + ;

 const int INF = 0x3f3f3f3f;

 int p[maxn];

 int tot;

 void init()

 {

     for(int i = ; i < maxn; i++)p[i] = i;

 }

 int f(int x)

 {

     return x == p[x] ? x : p[x] = f(p[x]);

 }

 void Union(int x, int y)

 {

     x = f(x);

     y = f(y);

     if(x != y)

     {

         p[x] = y;//这里改成p[y] = x;有时过，有时会超时

         tot--;//不联通的数目减一

     }

 }

 struct edge

 {

     int u, v, w;

     bool operator < (const edge& a)

     {

         return w < a.w;

     }

 }a[maxn * maxn];

 int main()

 {

     int T, n, m, k, t, x, y;

     scanf("%d", &T);

     while(T--)

     {

         init();

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

         tot = n - ;//最开始，不连通块数目为n-1

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

         {

             scanf("%d%d%d", &a[i].u, &a[i].v, &a[i].w);

         }

         sort(a + , a +  + m);

         while(k--)

         {

             scanf("%d%d", &t, &x);

             t--;

             while(t--)

             {

                 scanf("%d", &y);

                 Union(x, y);

             }

         }

         int ans = ;/*

         for(int i = 1; i <= n; i++)cout<<p[i]<<" ";

         cout<<endl;*/

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

         {

             int x = a[i].u;

             int y = a[i].v;

             x = f(x), y = f(y);

             if(x != y)

             {

                 p[x] = y;

                 tot--;//不连通数目减一

                 ans += a[i].w;

             }

         }

         if(tot == )//全部连通

             printf("%d\n", ans);

         else

             printf("-1\n");

     }

     return ;

 }