#include<bits/stdc++.h>
using namespace std;
const int MOD=998244353,N=2005;
inline int mo1(int x){ return x>=MOD?x-MOD:x; }
inline void mo(int& x){x>=MOD?x-=MOD:0;}
vector<int> e[N];
int dep[N],cnt[N];
void dfs(int x,int pre){
    dep[x]=dep[pre]+1; cnt[dep[x]]++;
    for(auto y:e[x])
        if(y!=pre)
            dfs(y,x);
}
int dfs1(int x,int pre){
    int ret=1;
    for(auto y:e[x])
        if(y!=pre)
            ret=max(ret,dfs1(y,x)+1);
    return ret;
}
bool vis[N];
int main(){
    int T; scanf("%d",&T);
    while(T--){
        int n; scanf("%d",&n);
        for(int i=1;i<=n;++i) e[i].clear();
        for(int i=1;i<n;++i){
            int x,y; scanf("%d%d",&x,&y);
            e[x].push_back(y); e[y].push_back(x);
        }
        int mx=0,ans=0;
        for(int x=1;x<=n;++x) mx=max(mx,dfs1(x,0));
        for(int x=1;x<=n;++x) vis[x]=dfs1(x,0)==mx;
        for(int x=1;x<=n;++x){
            if(vis[x]){
                for(int y=1;y<=n;++y) cnt[y]=dep[y]=0;
                dfs(x,0);
                cnt[mx+1]=1;
                for(int i=mx;i>=1;--i)
                    cnt[i]=1ll*cnt[i+1]*cnt[i]%MOD;
                mo(ans+=cnt[1]);
                for(int y=1;y<x;++y)
                    if(vis[y])
                        mo(ans+=MOD-cnt[dep[y]+1]);
            }
        }
        printf("%d %d\n",mx,ans);
    }
    return 0;
}