#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define _for(i,a,b) for(register int (i)=(a);(i)<=(b);(i)++)
#define For(i,a,b) for(register int (i)=(a);(i)>=(b);(i)--)
#define INF 0x7fffffff
#define il inline
#define rg register
const int N=2010;
const int mod=998244353;
ll a[N];
int d[N],v[N],cnt;
ll num;
vector<int>g[N];
il void dfs(rg int x,rg int fa){
    for(rg int i=0;i<g[x].size();++i){
        rg int y=g[x][i];
        if(y==fa) continue;
        d[y]=d[x]+1; 
        cnt+=(! v[d[y]]++);
        dfs(y,x);
    }
}
il ll ask(){
    rg ll res=1;
    _for(i,1,2000)
        if(!v[i]) return num+=v[i-1], res;
        else res=res*v[i]%mod;
    return res;
}
il void work(){
    rg int n,a,b; scanf("%d",&n);
    _for(i,1,n) g[i].clear();
    _for(i,1,n-1) scanf("%d%d",&a,&b), g[a].push_back(b), g[b].push_back(a);
    rg int qwq=0;
    rg ll ans=0;
    _for(i,1,n){
        memset(v,0,sizeof(v));
        d[i]=0, cnt=1, dfs(i,0);
        if(qwq<cnt) num=0, qwq=cnt, ans=ask();
        else if(qwq==cnt) ans=(ans+ask())%mod;
    } 
    printf("%d %lld\n",qwq,(ans+mod-num/2)%mod);
}
int main(){
    int T; scanf("%d",&T);
    while(T--) work();
    return 0;
}