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

const int MAXN = 5e5 + 10, MAXM = 1e6 + 10;
int h[MAXN], e[MAXM], ne[MAXM], idx;
void AddEdge(int u, int v) {
	e[idx] = v, ne[idx] = h[u], h[u] = idx++;
}

int T, n;
int dp[MAXN][3];

void dfs(int u, int fa) {
	int sum0 = 0, sum = 0;
	for (int i = h[u]; ~i; i = ne[i]) {
		int v = e[i];
		if (v == fa) continue;
		dfs(v, u);
		sum += max({dp[v][2], dp[v][1], dp[v][0]});
		sum0 += dp[v][0];
	}
	dp[u][0] = sum;
	dp[u][2] = sum0 + 1;
	dp[u][1] = dp[u][2];
	for (int i = h[u]; ~i; i = ne[i]) {
		int v = e[i];
		if (v == fa) continue;
		dp[u][1] = max(dp[u][1], 1 + sum0 - dp[v][0] + dp[v][2]);
	}
}



int main() {
	scanf("%d", &T);
	while (T--) {
		scanf("%d", &n);
		idx = 0;
		for (int i = 1; i <= n; i++) h[i] = -1, dp[i][0] = dp[i][1] = dp[i][2] = 0;
		int u, v;
		for (int i = 1; i < n; i++) {
			scanf("%d%d", &u, &v);
			AddEdge(u, v);
			AddEdge(v, u);
		}
		dfs(1, 0);
		printf("%d\n", max({dp[1][0], dp[1][1], dp[1][2]}));
	}

	return 0;
}