#include<bits/stdc++.h>
using namespace std;
const int mo=998244353;
const int N=2011;
vector<int> e[N];
int d[N],n;
void bfs(int S){
    queue<int> q;
    memset(d,0,sizeof d);
    d[S]=1;
    q.push(S);
    while(!q.empty()){
        int x=q.front();
        q.pop();
        for(int y:e[x]){
            if(!d[y]){
                d[y]=d[x]+1;
                q.push(y);
            }
        }
    }
}
int f[N];
int main(){
#ifdef flukehn
    freopen("f.in","r",stdin);
#endif
    int T;
    cin>>T;
    while(T--){
        cin>>n;
        for(int i=1;i<=n;++i)e[i].clear();
        for(int i=1;i<n;++i){
            int x,y;
            cin>>x>>y;
            e[x].push_back(y);
            e[y].push_back(x);
        }
        int mx=0;
        long long tot=0;
        for(int i=1;i<=n;++i){
            bfs(i);
            for(int j=1;j<=n;++j){
                if(d[j]>mx) mx=d[j], tot=0;
            }
            //for(int j=1;j<=n;++j)cerr<<d[j]<<" \n"[j==n];
            for(int j=1;j<=n;++j)f[j]=0;
            for(int j=1;j<=n;++j){
                f[d[j]]++;
            }
            //for(int j=1;j<=n;++j)cerr<<f[j]<<" \n"[j==n];
            int tmp=1;
            for(int j=1;j<=mx;++j)
                tmp=1LL*tmp*f[j]%mo;
            for(int j=i+1;j<=n;++j)if(d[j]==mx)--tot;
            //cerr<<tmp<<endl;
            tot += tmp;
        }
        cout<<mx<<" "<<tot%mo<<"\n";
    }
}