#include<cstdio>
#include<cstdlib>
#include<cmath>
#include<cstring>
#include<algorithm>
#define rep(i,x,y) for(register int i=x;i<=y;++i)
#define repd(i,x,y) for(register int i=x;i>=y;--i)
#define ll long long
using namespace std;
const int N=1e6;
const int mod=1e9+7;
int T,n;
ll dp[N],sum[N],head[N],cnt;
ll ans;
struct {
    int v,nxt;
}e[N];

void readin(){
    scanf("%d",&n);
    rep(i,2,n){
        int x;
        scanf("%d",&x);
        e[cnt].v=i;
        e[cnt].nxt=head[x];
        head[x]=cnt++;
    }
}

void dfs(int u){
    sum[u]=1;
    dp[u]=1;
    for(int i=head[u];i!=-1;i=e[i].nxt){
        int x=e[i].v;
        dfs(x);
        dp[u]=(dp[u]*(sum[x]+1)%mod+dp[x]*sum[u]%mod)%mod;
        sum[u]=(sum[u]*(sum[x]+1))%mod;
    }
    ans=(ans+dp[u])%mod;
}

int main(){
    //ios::sync_with_stdio(false);
    scanf("%d",&T);
    while(T--){
        ans=0;
        cnt=0;
        memset(head,-1,sizeof(head));
        readin();
        dfs(1);
        //cout<<ans<<endl;
        printf("%lldn",ans);
    }
    return 0;
}