UVA 793

#include <bits/stdc++.h>

using namespace std;
class UF{
    int *a, *sz;
    int n;

public:
    UF(int n){
        sz = new int[n];
        a = new int[n];
        this->n = n;

        for(int i =0 ; i < n; i++)
            a[i] = i, sz[i] = 1;
    }

    ~UF(){
        delete sz;
        delete a;
    }

    int root(int p){
        while(a[p] != p) {
            a[p] = a[a[p]];
            p = a[p];
        }
        return p;
    }

    void merge(int p, int q){
        int i = root(p);
        int j = root(q);

        if(i == j) return;

        if(sz[i] > sz[j]) a[j] = i, sz[i] += sz[j];
        else a[i] = j, sz[j] += sz[i];
    }

    bool find(int p, int q){
        return root(p) == root(q);
    }

};

int main(){
    //ios_base::sync_with_stdio(false);
    //cin.tie(NULL);

    int t;
    cin >> t;

    while(t--){
        int n;
        cin >> n;
        UF uf(n+1);
        cin.get();

        int a = 0, s = 0;
        while(cin.peek() != '\n' && cin.peek() != EOF){
            char c;
            int x,y;
            cin >> c >> x >> y;
            cin.get();

            if(c == 'c'){
                if(!uf.find(x,y))
                    uf.merge(x,y);
            }else{
                if(uf.find(x,y))s++;
                a++;
            }
        }

        cout << s << "," << (a-s) << endl;
        if(t) cout << endl;
    }

    return 0;
}