#include<bits/stdc++.h>
#define ll long long
#define For(i,a,b) for(int i=(a);i<=(b);++i)
#define Rof(i,a,b) for(int i=(a);i>=(b);--i)
using namespace std;
const int Maxn=1e6;

inline int read()
{
    char ch=getchar();
    int f=1,x=0;
    while(ch>'9' || ch<'0')
    {
        if(ch=='-') f=-1;
        ch=getchar();
    }
    while(ch>='0' && ch<='9')
    {
        x=x*10+ch-'0';
        ch=getchar();
    }
    return x*f;
}

int n,m,siz[Maxn+5],fa[Maxn+5];
int ans[Maxn+5],chk[Maxn+5]; ll f[Maxn+5];
vector<int> v[Maxn+5];

inline void dfs(int x,int mid)
{
    ll sum=0; for(auto y:v[x]) dfs(y,mid),sum+=f[y];
    f[x]=max(sum-mid,0ll)+1;
}
inline int Check(int mid) {dfs(1,mid); return f[1]<=1;}
inline void Clear()
{
    For(i,1,n) ans[i]=chk[i]=0,vector<int>().swap(v[i]);
}
inline void Solve()
{
    n=read();
    For(i,2,n) {int x=read(); fa[i]=x,v[x].push_back(i);}
    int l=0,r=n; while(l<r)
    {
        int mid=(l+r)/2;
        if(Check(mid)) r=mid; else l=mid+1;
    } m=l; dfs(1,m-1);
    if(f[1]==2)
    {
        chk[1]=1;
        For(i,2,n) if(f[i]>1 && chk[fa[i]]) chk[i]=1;
    }
    Rof(i,n,1) {siz[i]=1; for(auto j:v[i]) siz[i]+=siz[j];}
    For(i,1,n)
    {
        if(m<=siz[i]-2) ans[i]=1;
        if(m==siz[i]-1 && chk[i]) ans[i]=1;
    }
    For(i,1,n) putchar(ans[i]+'0');
    putchar('\n'),Clear();
}

int main()
{
    // freopen("1.in","r",stdin);

    int T=read();
    while(T--) Solve();
    return 0;
}