TOI14: Blockchain

#include <bits/stdc++.h>

using namespace std;

using pii = pair< int, int>;

int main(){

    int T, Q;
    scanf("%d%d", &T, &Q);

    map <vector<pii>, int> keep;

    for(int t=1;t<=T;t++){
        int n;
        scanf("%d", &n);
        vector <pii> path;
        for(int i=1;i<n;i++){
            int u, v;
            scanf("%d%d", &u, &v);
            if(u > v) swap(u, v);
            path.push_back({u, v});
        }
        sort(path.begin(), path.end());
        keep[path] ++;
    }

    for(int q=1;q<=Q;q++){
        int n;
        scanf("%d", &n);
        vector <pii> path;
        for(int i=1;i<n;i++){
            int u, v;
            scanf("%d%d", &u, &v);
            if(u > v) swap(u, v);
            path.push_back({u, v});
        }
        sort(path.begin(), path.end());

        printf("%d\n", keep[path]);
    }

    return 0;
}