#pragma GCC optimize("Ofast")
#pragma GCC target ("sse4")

#include<iostream>
#include<string>
#include<cstdio>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<bitset>
#include<stack>
#include<unordered_map>
#include<unordered_set>
#include<utility>
#include<cassert>
#include<complex>
#include<numeric>
#include<array>
using namespace std;

//#define int long long
typedef long long ll;

typedef unsigned long long ul;
typedef unsigned int ui;
constexpr ll mod = 998244353;
const ll INF = mod * mod;
typedef pair<int, int>P;
#define stop char nyaa;cin>>nyaa;
#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define Rep(i,sta,n) for(int i=sta;i<n;i++)
#define rep1(i,n) for(int i=1;i<=n;i++)
#define per1(i,n) for(int i=n;i>=1;i--)
#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)
#define all(v) (v).begin(),(v).end()
typedef pair<ll, ll> LP;
typedef double ld;
typedef pair<ld, ld> LDP;
const ld eps = 1e-12;
const ld pi = acosl(-1.0);

ll mod_pow(ll x, ll n, ll m = mod) {
	ll res = 1;
	while (n) {
		if (n & 1)res = res * x % m;
		x = x * x % m; n >>= 1;
	}
	return res;
}
struct modint {
	ll n;
	modint() :n(0) { ; }
	modint(ll m) :n(m) {
		if (n >= mod)n %= mod;
		else if (n < 0)n = (n % mod + mod) % mod;
	}
	operator int() { return n; }
};
bool operator==(modint a, modint b) { return a.n == b.n; }
modint operator+=(modint& a, modint b) { a.n += b.n; if (a.n >= mod)a.n -= mod; return a; }
modint operator-=(modint& a, modint b) { a.n -= b.n; if (a.n < 0)a.n += mod; return a; }
modint operator*=(modint& a, modint b) { a.n = ((ll)a.n * b.n) % mod; return a; }
modint operator+(modint a, modint b) { return a += b; }
modint operator-(modint a, modint b) { return a -= b; }
modint operator*(modint a, modint b) { return a *= b; }
modint operator^(modint a, ll n) {
	if (n == 0)return modint(1);
	modint res = (a * a) ^ (n / 2);
	if (n % 2)res = res * a;
	return res;
}

ll inv(ll a, ll p) {
	return (a == 1 ? 1 : (1 - p * inv(p % a, a)) / a + p);
}
modint operator/(modint a, modint b) { return a * modint(inv(b, mod)); }

const int max_n = 1 << 18;
modint fact[max_n], factinv[max_n];
void init_f() {
	fact[0] = modint(1);
	for (int i = 0; i < max_n - 1; i++) {
		fact[i + 1] = fact[i] * modint(i + 1);
	}
	factinv[max_n - 1] = modint(1) / fact[max_n - 1];
	for (int i = max_n - 2; i >= 0; i--) {
		factinv[i] = factinv[i + 1] * modint(i + 1);
	}
}
modint comb(int a, int b) {
	if (a < 0 || b < 0 || a < b)return 0;
	return fact[a] * factinv[b] * factinv[a - b];
}

const int mn = 1 << 18;
struct edge {
	int to;
};

//can,canrev
using Data = pair<bool, bool>;
vector<edge> G[mn];
int mi[mn];
vector<int> ids[mn];
vector<Data> memo[mn];
int root;


Data dfs(int id, int fr) {
	Data res;

	vector<pair<bool, bool>> vb;
	for (edge e : G[id]) {
		if (e.to == fr)continue;
		Data nex = dfs(e.to, id);
		if (mi[e.to] != id) {
			nex.second = false;
		}
		//cout << "? " << e.to << " " << id << " " << nex.first << " " << nex.second << "\n";
		vb.push_back(nex);
		ids[id].push_back(e.to);
		memo[id].push_back(nex);
	}
	//
	//update for return
	res.second = true;
	rep(j, ids[id].size()) {
		if (!vb[j].second)res.second = false;
	}
	res.first = true;
	int ma = 0;
	rep(j, ids[id].size())ma = max(ma, ids[id][j]);
	rep(j, ids[id].size()) {
		if (ids[id][j] == ma) {
			if (!vb[j].first)res.first = false;
		}
		else {
			if (!vb[j].second)res.first = false;
		}
	}
	bool b1 = true;
	rep(j, ids[id].size()) {
		if (ids[id][j] == mi[id]) {
			if (!vb[j].first)b1 = false;
		}
		else {
			if (!vb[j].second)b1 = false;
		}
	}
	if (b1)res.first = true;
	//
	return res;
}
bool ans[mn];
void invdfs(int id, int fr, Data pre) {
	if (fr >= 0) {
		//cout << id << " " << fr << " " << pre.first << " " << pre.second << "\n";
	}
	vector<Data> v;
	vector<int> vid;
	rep(j, memo[id].size()) {
		v.push_back(memo[id][j]);
		vid.push_back(ids[id][j]);
	}
	if (fr >= 0) {
		v.push_back(pre);
		vid.push_back(fr);
	}
	int len = v.size();
	//
	//calcurate id's ans
	int ma = 0;
	for (int to : vid)ma = max(ma, to);
	ans[id] = true;
	rep(j, vid.size()) {
		if (vid[j] == ma) {
			if (!v[j].first)ans[id] = false;
		}
		else {
			if (!v[j].second)ans[id] = false;
		}
	}
	bool b1 = true;
	rep(j, vid.size()) {
		if (vid[j] == mi[id]) {
			if (!v[j].first)b1 = false;
		}
		else {
			if (!v[j].second)b1 = false;
		}
	}
	if (b1)ans[id] = true;
	set<pair<int, Data>> st;
	int c0 = 0, c1 = 0;
	rep(j, v.size()) {
		st.insert({ vid[j],v[j] });
		if (v[j].first)c0++;
		if (v[j].second)c1++;
	}
	rep(i, ids[id].size()) {
		int to = ids[id][i];

		st.erase({ vid[i],v[i] });
		if (v[i].first)c0--;
		if (v[i].second)c1--;

		Data d = { true,true };
		if (c1 != (int)v.size() - 1)d.second = false;
		if (to != mi[id])d.second = false;

		if (st.size()) {
			pair<int, Data>las = *--st.end();
			int z = c1; if (las.second.second)z--;
			if (!las.second.first)d.first = false;
			if (z != (int)v.size() - 2)d.first = false;

			bool b1 = true;

			pair<int, Data> fst = *st.begin();
			if (fst.first == mi[id]) {
				z = c1; if (fst.second.second)z--;
				if (!fst.second.first)b1 = false;
				if (z != (int)v.size() - 2)b1 = false;
			}
			else b1 = false;

			if (b1)d.first = true;
		}
		else {
			d.first = true;
		}

		invdfs(to, id, d);
		st.insert({ vid[i],v[i] });
		if (v[i].first)c0++;
		if (v[i].second)c1++;
	}
}
void yaru() {
	dfs(root, -1);
	invdfs(root, -1, { true,true });
}

void solve() {
	int n; cin >> n;
	rep(i, n)mi[i] = mod;
	rep(i, n - 1) {
		int a, b; cin >> a >> b; a--; b--;
		G[a].push_back({ b });
		G[b].push_back({ a });
		mi[a] = min(mi[a], b);
		mi[b] = min(mi[b], a);
	}
	yaru();
	rep(i, n) {
		if (ans[i])cout << "Yes\n";
		else cout << "No\n";
	}
}

signed main() {
	ios::sync_with_stdio(false);
	cin.tie(0);
	//cout << fixed << setprecision(15);
	//init_f();
	//init();
	//expr();
	//int t; cin >> t; rep(i, t)
	solve();
	return 0;
}