#include <queue>
#include <vector>
#include <iostream>
#include <algorithm>
#include <functional>
using namespace std;
int main() {
	int Q;
	cin >> Q;
	while (Q--) {
		int N;
		cin >> N;
		vector<vector<int> > G(N);
		for (int i = 0; i < N - 1; ++i) {
			int a, b;
			cin >> a >> b; --a, --b;
			G[a].push_back(b);
			G[b].push_back(a);
		}
		int degree1 = 0;
		for (int i = 0; i < N; ++i) {
			if (G[i].size() == 1) {
				++degree1;
			}
		}
		cout << (degree1 * 2 >= N ? "Yes" : "No") << endl;
	}
	return 0;
}