#include<bits/stdc++.h>
using namespace std;
using ll = long long;

void solve() {
	int n;
	cin >> n;
	vector<int> fa(n + 1), f(n + 1);
	for (int i = 2; i <= n; i++) {
		cin >> fa[i];
	}
	auto calc = [&](int lim) {
		fill(f.begin(), f.end(), 0);
		for (int i = n; i > 1; i--) {
			f[i] = max(0, f[i] - lim) + 1;
			f[fa[i]] += f[i];
		}
	};
	int l = 1, r = n, ans = n + 1;
	while (l <= r) {
		int mid = (l + r) >> 1;
		calc(mid);
		if (f[1] <= mid) {
			ans = mid, r = mid - 1;
		} else {
			l = mid + 1;
		}
	}
	calc(0);
	vector sz = f;
	calc(ans - 1);
	vector<int> tag(n + 1);
	tag[1] = true;
	//cerr << ans << ' ' << f[1] << '\n';
	if (f[1] == ans) {
		for (int i = 2; i <= n; i++) {
			tag[i] = (tag[fa[i]] && f[i] > 1 && sz[i] - 1 >= ans);
		}
	}
	for (int i = 1; i <= n; i++) {
		if (sz[i] - 1 > ans) {
			tag[i] = true;
		}
		cout << (tag[i] ? 1 : 0);
	}
	cout << '\n';
}

int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr), cout.tie(nullptr);
	int T;
	cin >> T;
	while (T--) {
		solve();
	}
	return 0;
}