#include<bits/stdc++.h>
using namespace std;
const int N=100005;
int W,T;
int n;
vector<int>g[N];
int sz[N],f[N],dep[N];
int son1[N],son2[N];
int ans[N]; 
void dfs1(int u,int fa){
	dep[u]=dep[fa]+1;
	sz[u]=1;
	son1[u]=son2[u]=0;
	for(auto v:g[u]){
		if(v==fa)continue;
		dfs1(v,u);
		sz[u]+=sz[v]; 
		if(sz[v]>sz[son1[u]]){
			son2[u]=son1[u];son1[u]=v;
		}
		else if(sz[v]>sz[son2[u]]){
			son2[u]=v;
		}
	} 
	int v=son1[u];
	if(sz[v]-2*f[v]<=sz[u]-sz[v]-1)f[u]=(sz[u]-1)/2;
	else f[u]=2*f[v]+sz[u]-sz[v]-1;
} 
int h;
void dfs2(int u,int fa){
	int tmp1=h;
	if(!h||sz[son2[u]]>sz[h])h=son2[u];
	int tmp2=h;
	if(!h||sz[son1[u]]>=sz[h])h=son1[u];
	int tmp3=h;
	if((n-dep[u])%2==0&&sz[h]-2*f[h]<=n-dep[u]-sz[h])ans[u]=1;
	else ans[u]=0; 
	for(auto v:g[u]){
		if(v==fa)continue;
		if(v==son1[u])h=tmp2;
		else h=tmp3;
		dfs2(v,u);
	}
	h=tmp1;
}
void solve(){
	cin>>n;
	for(int i=1;i<=n;i++)g[i].clear();
	for(int i=1;i<n;i++){
		int x,y;cin>>x>>y;
		g[x].push_back(y);g[y].push_back(x);
	}
	dfs1(1,0);h=0;
	dfs2(1,0);
	if(W==3){
		cout<<ans[1]<<"\n";
	}
	else{
		for(int i=1;i<=n;i++)cout<<ans[i];cout<<"\n";
	}
}
int main(){
//	cin.tie(0);cout.tie(0);
//	ios::sync_with_stdio(0);
//	freopen("move.in","r",stdin);freopen("move.out","w",stdout);
	cin>>W>>T;
	while(T--)solve();
	return 0;
}