#include <cstdlib>
#include <cstdio>
#include <iostream>
#include <sstream>
#include <cstring>
#include <string>
#include <utility>
#include <stack>
#include <queue>
#include <vector>
#include <algorithm>
#include <functional>
#include <bitset>
 
using namespace std;
 
int main() {
    int v, e;
    bitset < 26 > edges;
    char x, y;
    char a[100];
    int t;
    scanf("%d\n", &t);
    while (t--) {
        v = 0, e = 0;
        while (gets(a), a[0] != '*') {
            e++; // total no of edges in the graph
            sscanf(a, "(%c,%c)", &x, &y);
            /* marking all the verices with at least one edge*/
            edges.set((x - 'A'));
            edges.set((y - 'A'));
        }
        int connected_vertices = edges.count(); // no of set bits
        gets(a);
        string line(a);
        v = count(line.begin(), line.end(), ',') + 1; // total no of vertices in the graph
        // no of connected components in a graph =v-e
        int acron = v - connected_vertices; // no of acrons= total vertices - (connected_vertices)
        int tree = v - e - acron;
        printf("There are %d tree(s) and %d acron(s).\n", tree, acron);
        edges.reset();
    }
    return 0;
}
 
 

I2luY2x1ZGUgPGNzdGRsaWI+CiNpbmNsdWRlIDxjc3RkaW8+CiNpbmNsdWRlIDxpb3N0cmVhbT4KI2luY2x1ZGUgPHNzdHJlYW0+CiNpbmNsdWRlIDxjc3RyaW5nPgojaW5jbHVkZSA8c3RyaW5nPgojaW5jbHVkZSA8dXRpbGl0eT4KI2luY2x1ZGUgPHN0YWNrPgojaW5jbHVkZSA8cXVldWU+CiNpbmNsdWRlIDx2ZWN0b3I+CiNpbmNsdWRlIDxhbGdvcml0aG0+CiNpbmNsdWRlIDxmdW5jdGlvbmFsPgojaW5jbHVkZSA8Yml0c2V0PgoKdXNpbmcgbmFtZXNwYWNlIHN0ZDsKCmludCBtYWluKCkgewogICAgaW50IHYsIGU7CiAgICBiaXRzZXQgPCAyNiA+IGVkZ2VzOwogICAgY2hhciB4LCB5OwogICAgY2hhciBhWzEwMF07CiAgICBpbnQgdDsKICAgIHNjYW5mKCIlZFxuIiwgJnQpOwogICAgd2hpbGUgKHQtLSkgewogICAgICAgIHYgPSAwLCBlID0gMDsKICAgICAgICB3aGlsZSAoZ2V0cyhhKSwgYVswXSAhPSAnKicpIHsKICAgICAgICAgICAgZSsrOyAvLyB0b3RhbCBubyBvZiBlZGdlcyBpbiB0aGUgZ3JhcGgKICAgICAgICAgICAgc3NjYW5mKGEsICIoJWMsJWMpIiwgJngsICZ5KTsKICAgICAgICAgICAgLyogbWFya2luZyBhbGwgdGhlIHZlcmljZXMgd2l0aCBhdCBsZWFzdCBvbmUgZWRnZSovCiAgICAgICAgICAgIGVkZ2VzLnNldCgoeCAtICdBJykpOwogICAgICAgICAgICBlZGdlcy5zZXQoKHkgLSAnQScpKTsKICAgICAgICB9CiAgICAgICAgaW50IGNvbm5lY3RlZF92ZXJ0aWNlcyA9IGVkZ2VzLmNvdW50KCk7IC8vIG5vIG9mIHNldCBiaXRzCiAgICAgICAgZ2V0cyhhKTsKICAgICAgICBzdHJpbmcgbGluZShhKTsKICAgICAgICB2ID0gY291bnQobGluZS5iZWdpbigpLCBsaW5lLmVuZCgpLCAnLCcpICsgMTsgLy8gdG90YWwgbm8gb2YgdmVydGljZXMgaW4gdGhlIGdyYXBoCiAgICAgICAgLy8gbm8gb2YgY29ubmVjdGVkIGNvbXBvbmVudHMgaW4gYSBncmFwaCA9di1lCiAgICAgICAgaW50IGFjcm9uID0gdiAtIGNvbm5lY3RlZF92ZXJ0aWNlczsgLy8gbm8gb2YgYWNyb25zPSB0b3RhbCB2ZXJ0aWNlcyAtIChjb25uZWN0ZWRfdmVydGljZXMpCiAgICAgICAgaW50IHRyZWUgPSB2IC0gZSAtIGFjcm9uOwogICAgICAgIHByaW50ZigiVGhlcmUgYXJlICVkIHRyZWUocykgYW5kICVkIGFjcm9uKHMpLlxuIiwgdHJlZSwgYWNyb24pOwogICAgICAgIGVkZ2VzLnJlc2V0KCk7CiAgICB9CiAgICByZXR1cm4gMDsKfQoK

MgooQSxCKQooQixDKQooQixEKQooRCxFKQooRSxGKQooQixHKQooRyxIKQooRyxJKQooSixLKQooSyxMKQooSyxNKQoqKioqCkEsQixDLEQsRSxGLEcsSCxJLEosSyxMLE0sTgooQSxCKQooQSxDKQooQyxGKQoqKgpBLEIsQyxELEYK

2
(A,B)
(B,C)
(B,D)
(D,E)
(E,F)
(B,G)
(G,H)
(G,I)
(J,K)
(K,L)
(K,M)
****
A,B,C,D,E,F,G,H,I,J,K,L,M,N
(A,B)
(A,C)
(C,F)
**
A,B,C,D,F