// LUOGU_RID: 98460529
#include<bits/stdc++.h>
using namespace std;
const int MAXN=1e5+1;
int deg[MAXN];
vector <int> G[MAXN];
inline void dfs(int p,int f,int d) {
	deg[p]*=d;
	for(int v:G[p]) if(v!=f) dfs(v,p,d*-1);
}
inline void solve() {
	int n;
	scanf("%d",&n);
	for(int i=1;i<=n;++i) G[i].clear(),deg[i]=0;
	for(int i=1;i<n;++i) {
		int u,v;
		scanf("%d%d",&u,&v);
		G[u].push_back(v);
		G[v].push_back(u);
		++deg[u],++deg[v];
	}
	dfs(1,0,1);
	for(int i=1;i<=n;++i) printf("%d ",deg[i]);
	puts("");
}
signed main() {
	int T;
	scanf("%d",&T);
	while(T--) solve();
	return 0;
}