#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int N = 1e5 + 10;
vector<int> eg[N];
int siz[N], deg[N];
void dfs(int u, int p) {
	if(eg[u].size() == 1) siz[p] ++;
	for(auto v : eg[u]) {
		if(v == p) continue;
		dfs(v, u);
	}
}

void solve() {
	int n;
	cin >> n; 
	for(int i = 0;  i<= n; i ++) eg[i].clear(), deg[i] = siz[i] = 0;
	for(int i = 1; i < n; i ++) {
		int x, y;
		cin >> x >> y;
		eg[x].push_back(y);
		eg[y].push_back(x);
		deg[x] ++, deg[y] ++;
	}
	if(n == 2) {
		cout << -1 << "\n";
		return;
	}
	int s;
	for(int i = 1; i <= n; i ++) {
		if(deg[i] >= 2) {
			s = i;
			break;
		}
	}
	dfs(s, 0);
	// vector<int> res;
 	priority_queue<int> q;
 	for(int i = 1; i <= n; i ++) {
 		if(siz[i]) q.push(siz[i]);
 	}
 	if(q.size() == 1) {
 		cout << -1 << "\n";
 		return;
 	}
 	int ans = 0;
 	while(q.size() > 1) {
 		int tmp = q.top();
 		q.pop();
 		ans += q.top();
 		tmp -= q.top();
 		q.pop();
 		q.push(tmp);
 	}
 	cout << ans + q.top() << "\n";
}

void ddd() {
	int n;
	cin >> n;
	int ans = 0;
	vector<int> res(n + 1);
	for(int i = 0; i < n; i ++) res[i] = n - i;
	int now = res[0];
 	for(int i = 1; i < n; i ++) {
 		if(now >= res[i]) {
 			now -= res[i];
 			ans += res[i];
 		} else {
 			res[i] -= now;
 			ans += now;
 			now = res[i];
 		}
 	}
 	cout << ans + now << "\n";
}

int main() {
	int t;
	cin >> t;
	while(t --) solve();
}