// Hydro submission #6720c77337be2064ac9890c6@1730255052009
#include<bits/stdc++.h>
using namespace std;
const int mod=1e9+7;

int n,fa[200001],siz[200001],maxn[200001][3],f[200001];

inline void update(int u,int val){
    if(val>maxn[u][0])maxn[u][2]=maxn[u][1],maxn[u][1]=maxn[u][0],maxn[u][0]=val;
    else if(val>maxn[u][1])maxn[u][2]=maxn[u][1],maxn[u][1]=val;
    else if(val>maxn[u][2])maxn[u][2]=val;
}
inline int sum(int l,int r){
    return 1ll*(l+r)*(r-l+1)/2%mod;
}

int main(){
    int T; scanf("%d",&T);
    while(T--){
        scanf("%d",&n);
        for(int i=1;i<=n;i++){
            maxn[i][0]=maxn[i][1]=maxn[i][2]=f[i]=0;
            siz[i]=1;
        }
        for(int i=2;i<=n;i++)scanf("%d",fa+i);
        for(int i=n;i>=1;i--){
            update(i,n-siz[i]);
            if(fa[i])update(fa[i],siz[i]),siz[fa[i]]+=siz[i];
        }
        long long answer=0;
        for(int i=2;i<=n;i++){
            int u=i,v=fa[i];
            if(maxn[u][0]<maxn[v][0])answer+=1ll*sum(maxn[u][0]+1,maxn[v][0])*sum(1,n-siz[u])%mod;
            else answer+=1ll*sum(maxn[v][0]+1,maxn[u][0])*sum(1,siz[u])%mod;
        }
        for(int i=1;i<=n;i++)f[maxn[i][1]]=max(f[maxn[i][1]],maxn[i][2]);
        for(int i=n-1;i>=1;i--)f[i]=max(f[i],f[i+1]);
        int minn=n;
        for(int i=1;i<=n;i++)minn=min(minn,maxn[i][0]);
        for(int i=1;i<=minn;i++){
            int x=min(i,f[i]);
            answer+=1ll*i*sum(1,x)%mod;
            answer+=2ll*i*sum(x+1,i)%mod;
        }
        answer=2*answer%mod;
        for(int i=1;i<=minn;i++)
            answer-=(i<=f[i]?1ll:2ll)*i*i%mod;
        printf("%lld\n",(answer%mod+mod)%mod);
    }
    return 0;
}