#include <stdio.h>

 #include <string.h>

 #include <vector>

 using namespace std;

 const int N = ;

 const int inf = 0x3f3f3f3f;

 struct edge

 {

     int from,to,cost;

     edge(int a,int b,int c)

     {

         from = a;

         to = b;

         cost = c;

     }

 };

 int in[],pre[],vis[],id[];

 vector<edge> es;

 int zhu_liu(int n)

 {

     int res = ;

     int root = ;

     while ()

     {

         memset(vis,-,sizeof(vis));

         memset(id,-,sizeof(id));

         memset(in,inf,sizeof(in));

         for (int i = ;i < es.size();i++)

         {

             edge e = es[i];

             int to = e.to;

             if (e.from != e.to && e.cost < in[to])

             {

                 in[to] = e.cost;

                 pre[e.to] = e.from;

             }

         }

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

         {

             if (i != root && in[i] == inf) return -;

         }

         in[root] = ;

         int cnt = ;

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

         {

             res += in[i];

             int v = i;

             while (vis[v] != i && id[v] == - && v != root)

             {

                 vis[v] = i;

                 v = pre[v];

             }

             if (id[v] == - && v != root)

             {

                 for (int u = pre[v];u != v;u = pre[u])

                 {

                     id[u] = cnt;

                 }

                 id[v] = cnt++;

             }

         }

         if (cnt == ) break;

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

         {

             if (id[i] == -) id[i] = cnt++;

         }

         for (int i = ;i < es.size();i++)

         {

             edge e = es[i];

             int v = e.to;

             es[i].to = id[es[i].to];

             es[i].from = id[es[i].from];

             if (es[i].to != es[i].from) es[i].cost -= in[v];

         }

         root = id[root];

         n = cnt;

     }

     return res;

 }

 int main()

 {

     int t;

     int kase = ;

     scanf("%d",&t);

     while (t--)

     {

         int n,m;

         es.clear();

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

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

         {

             int a,b,c;

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

             es.push_back(edge(a,b,c));

         }

         int ans = zhu_liu(n);

         printf("Case #%d: ",++kase);

         if (ans == -) printf("Possums!\n");

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

     }

     return ;

 }