1208

#include<bits/stdc++.h>
using namespace std;

#define pb push_back
#define ll long long
#define pii pair<int,int>
#define pll pair<ll,ll>
//#define M 100007
#define INF 1e9
#define INFL 1e18
#define PI acos(-1)
#define mp make_pair
#define fast_in_out ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);

#include<bits/stdc++.h>
using namespace std;
#define M 1000000


long long pr[M];

struct edge
{
    long long u,v,w;
    bool operator<(const edge& p)const
    {
        return w<p.w;
    }
};
vector<edge>e,tree;
vector<int>cost;
long long root(long long i)
{
    while(pr[i]!=i)
    {
        i=pr[i];
    }
    return i;
}


int  mst(int n)
{
    sort(e.begin(),e.end(),cmp);
    for(int i=0;i<n;i++)
        pr[i]=i;
    int cnt=0,s=0;
    for(int i=0;i<e.size();i++)
    {
        int u=root(e[i].u);
        int v=root(e[i].v);
        if(u!=v)
        {
            pr[u]=v;
            cnt++;
            //cout<<u+1<<" "<<v+1<<" "<<e[i].w<<endl;
            tree.pb(e[i]);

            s+=e[i].w;
            if(cnt==n-1)
                break;
        }
    }

    return s;
}


int myfunc(char c[])
{
    int num=0;
    for(int i=0;i<strlen(c);i++)
    {
        num=num*10+(c[i]-'0');
    }
    return num;
}


int main()
{
    fast_in_out;
    int t,kase=0;
    cin>>t;
    while(kase<t)
    {

    int n;
    cin>>n;
    vector<int>v[n+5];
    for(int i=0;i<n;i++)
    {
        char str[10000];
        gets(str);
        char *token=strtok(str," ,");
        while(token!=NULL)
        {
            int num=myfunc(token);
            v[i].pb(num);
            token=strtok(NULL," ,");
        }
    }

    for(int i=0;i<n;i++)
    {
     for(int j=0;j<v[i].size();j++)
    {
        if(v[i][j]!=0)
        {

            edge E;
            E.u=i;
            E.v=j;
            E.w=v[i][j];
          //  cout<<E.u+1<<" "<<E.v+1<<" "<<E.w<<endl;
            e.pb(E);
        }
    }
    }

    int ans=mst(n);
    cout<<"Case "<<kase+1<<" :"<<endl;
    for(int i=-0;i<tree.size();i++)
    {
        int x=tree[i].u;
        int y=tree[i].v;
        int w=tree[i].w;
         char first=(char)min(x,y);
        char second=(char)max(x,y);
        first=first+'A';
     second=second+'A';
      cout<<first<<"-"<<second<<" "<<w<<endl;
    }
    kase++;
    e.clear();
    tree.clear();
    cost.clear();
    }
    return 0;