/*luogumxT559325 【MX-X15-T2】系绳绳*/
#include <iostream>
#include <cstring>

const int N = 2e5+5;
using namespace std;

int main() {
	int a[N];
	int t;
	cin >> t;
	while (t--) {
		memset(a, 0, sizeof a);
		int n;
		cin >> n;
		for (int i = 1; i <= n - 1; i++) {
			int u = 0, v = 0;
			cin >> u >> v;
			a[u]++;
			a[v]++;
		}
		if (n <= 2) {
			cout << 0 << endl;
			continue;
		}
		int ans = 0;
		for (int i = 1; i <= n; i++) {
			if (a[i] == 1) {
				ans++;
			}
		}
		cout << ans - 1 << endl;

	}
	return 0;
}