#include <iostream>

#include <cstring>

#include <cstdio>

#include <vector>

#define mod 1000000007

using namespace std;

typedef long long ll;

const int M = ;

ll dp[M] , C[M][M];

int fa[M] , num[M];

vector<int> vc[M];

void find_num(int u , int pre) {

    num[u] = ;

    int len = vc[u].size();

    for(int i =  ; i < len ; i++) {

        int v = vc[u][i];

        if(v == pre) continue;

        find_num(v , u);

        num[u] += num[v];

    }

}

void dfs(int u , int pre) {

    int len = vc[u].size();

    ll ans =  , sum = num[u];

    for(int i =  ; i < len ; i++) {

        int v = vc[u][i];

        if(v == pre) continue;

        dfs(v , u);

        ans *= (C[sum - ][num[v]] * dp[v]) % mod;

        ans %= mod;

        sum -= num[v];

    }

    dp[u] = ans;

    dp[u] %= mod;

}

int main() {

    int t , n;

    int Case = ;

    scanf("%d" , &t);

    C[][] = ;

    for(int i =  ; i <= M -  ; i++) {

        C[i][] = ;

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

            C[i][j] = (C[i - ][j - ] + C[i - ][j]) % mod;

    }

    while(t--) {

        scanf("%d" , &n);

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

            vc[i].clear();

            dp[i] = ;

            fa[i] = -;

            num[i] = ;

        }

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

            int u , v;

            scanf("%d%d" , &u , &v);

            vc[u].push_back(v);

            fa[v] = u;

        }

        int root = ;

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

            if(fa[i] == -) {

                root = i;

                break;

            }

        }

        find_num(root , -);

        dfs(root , -);

        printf("Case %d: %lld\n" , ++Case , dp[root] % mod);

    }

    return ;

}