using System; using System.Collections.Generic; using System.Linq; using System.IO; using System.Threading; using System.Text; using System.Text.RegularExpressions; using System.Diagnostics; using static util; using P = pair; class Program { static void Main(string[] args) { var sw = new StreamWriter(Console.OpenStandardOutput()) { AutoFlush = false }; var solver = new Solver(sw); // var t = new Thread(solver.solve, 1 << 28); // 256 MB // t.Start(); // t.Join(); solver.solve(); sw.Flush(); } } class Solver { StreamWriter sw; Scan sc; void Prt(string a) => sw.WriteLine(a); void Prt(IEnumerable a) => Prt(string.Join(" ", a)); void Prt(params object[] a) => Prt(string.Join(" ", a)); public Solver(StreamWriter sw) { this.sw = sw; this.sc = new Scan(); } public void solve() { int n = sc.Int; var edges = new int[n - 1][]; for (int i = 0; i < n - 1; i++) { edges[i] = sc.IntArr.Select(x => x - 1).ToArray(); } var reRooting = new ReRooting(n, edges, node.identity, node.operate, node.operateNode); for (int i = 0; i < n; i++) { // Prt(reRooting.Query(i).status); Prt(reRooting.Query(i).status == 3 ? "No" : "Yes"); } } struct node { // 0: can return // 1: cannot return, but minchild // 2: cannot return // 3: cannot tour subtree public int status; public int maxvalue; public int minvalue; public int childminonlymaxv; public int childminonlyminv; public int childminexceptminvandmaxv; public node(int st, int ma, int mi, int cmoma, int cmomi, int cme) { status = st; maxvalue = ma; minvalue = mi; childminonlymaxv = cmoma; childminonlyminv = cmomi; childminexceptminvandmaxv = cme; } public static node identity = new node(0, -M, M, M, M, M); public static node operate(node a, node b) { if (a.maxvalue > b.maxvalue) { return operate(b, a); } int ma = Math.Max(a.maxvalue, b.maxvalue); int mi = Math.Min(a.minvalue, b.minvalue); int cmoma = b.childminonlymaxv; int cmomi; int cme = Math.Min(a.childminexceptminvandmaxv, b.childminexceptminvandmaxv); int st = Math.Max(a.status, b.status); if (a.minvalue < b.minvalue) { cmomi = a.childminonlyminv; if (a.minvalue != a.maxvalue) cme = Math.Min(cme, a.childminonlymaxv); if (b.minvalue != b.maxvalue) cme = Math.Min(cme, b.childminonlyminv); if (a.status >= 1 && b.status >= 1) { st = 3; } else if (b.status == 1) { st = Math.Max(st, 2); } } else { cmomi = b.childminonlyminv; cme = Math.Min(cme, a.childminonlymaxv); cme = Math.Min(cme, a.childminonlyminv); if (a.status >= 1 && b.status >= 1) { st = 3; } else if (a.status == 1) { st = Math.Max(st, 2); } } return new node(st, ma, mi, cmoma, cmomi, cme); } public static node operateNode(node a, int index) { int st = a.status; if (index > a.childminexceptminvandmaxv) { st = 3; } else if (st < 2 && (index > a.childminonlymaxv || index > a.childminonlyminv)) { st = 2; } return new node(st, index, index, a.minvalue, a.minvalue, M); } } } class pair : IComparable> { public T v1; public U v2; public pair() : this(default(T), default(U)) {} public pair(T v1, U v2) { this.v1 = v1; this.v2 = v2; } public int CompareTo(pair a) { int c = Comparer.Default.Compare(v1, a.v1); return c != 0 ? c : Comparer.Default.Compare(v2, a.v2); } public override string ToString() => v1 + " " + v2; public void Deconstruct(out T a, out U b) { a = v1; b = v2; } } static class util { public static readonly int M = 1000000007; // public static readonly int M = 998244353; public static readonly long LM = 1L << 60; public static readonly double eps = 1e-11; public static void DBG(string a) => Console.Error.WriteLine(a); public static void DBG(IEnumerable a) => DBG(string.Join(" ", a)); public static void DBG(params object[] a) => DBG(string.Join(" ", a)); public static void Assert(params bool[] conds) { if (conds.Any(x => !x)) throw new Exception(); } public static pair make_pair(T v1, U v2) => new pair(v1, v2); public static int CompareList(IList a, IList b) where T : IComparable { for (int i = 0; i < a.Count && i < b.Count; i++) if (a[i].CompareTo(b[i]) != 0) return a[i].CompareTo(b[i]); return a.Count.CompareTo(b.Count); } public static bool inside(int i, int j, int h, int w) => i >= 0 && i < h && j >= 0 && j < w; public static readonly int[] dd = { 0, 1, 0, -1 }; // static readonly string dstring = "RDLU"; public static IEnumerable

adjacents(int i, int j) => Enumerable.Range(0, dd.Length).Select(k => new P(i + dd[k], j + dd[k ^ 1])); public static IEnumerable

adjacents(int i, int j, int h, int w) => adjacents(i, j).Where(p => inside(p.v1, p.v2, h, w)); public static IEnumerable

adjacents(this P p) => adjacents(p.v1, p.v2); public static IEnumerable

adjacents(this P p, int h, int w) => adjacents(p.v1, p.v2, h, w); public static IEnumerable all_subset(this int p) { for (int i = 0; ; i = i - p & p) { yield return i; if (i == p) break; } } public static Dictionary compress(this IEnumerable a) => a.Distinct().OrderBy(v => v).Select((v, i) => new { v, i }).ToDictionary(p => p.v, p => p.i); public static Dictionary compress(params IEnumerable[] a) => compress(a.SelectMany(x => x)); public static T[] inv(this Dictionary dic) { var res = new T[dic.Count]; foreach (var item in dic) res[item.Value] = item.Key; return res; } public static void swap(ref T a, ref T b) where T : struct { var t = a; a = b; b = t; } public static void swap(this IList a, int i, int j) where T : struct { var t = a[i]; a[i] = a[j]; a[j] = t; } public static T[] copy(this IList a) { var ret = new T[a.Count]; for (int i = 0; i < a.Count; i++) ret[i] = a[i]; return ret; } } class Scan { StreamReader sr; public Scan() { sr = new StreamReader(Console.OpenStandardInput()); } public Scan(string path) { sr = new StreamReader(path); } public int Int => int.Parse(Str); public long Long => long.Parse(Str); public double Double => double.Parse(Str); public string Str => ReadLine.Trim(); public string ReadLine => sr.ReadLine(); public pair Pair() { T a; U b; Multi(out a, out b); return new pair(a, b); } public P P => Pair(); public int[] IntArr => StrArr.Select(int.Parse).ToArray(); public long[] LongArr => StrArr.Select(long.Parse).ToArray(); public double[] DoubleArr => StrArr.Select(double.Parse).ToArray(); public string[] StrArr => Str.Split(new[]{' '}, StringSplitOptions.RemoveEmptyEntries); bool eq() => typeof(T).Equals(typeof(U)); T ct(U a) => (T)Convert.ChangeType(a, typeof(T)); T cv(string s) => eq() ? ct(int.Parse(s)) : eq() ? ct(long.Parse(s)) : eq() ? ct(double.Parse(s)) : eq() ? ct(s[0]) : ct(s); public void Multi(out T a) => a = cv(Str); public void Multi(out T a, out U b) { var ar = StrArr; a = cv(ar[0]); b = cv(ar[1]); } public void Multi(out T a, out U b, out V c) { var ar = StrArr; a = cv(ar[0]); b = cv(ar[1]); c = cv(ar[2]); } public void Multi(out T a, out U b, out V c, out W d) { var ar = StrArr; a = cv(ar[0]); b = cv(ar[1]); c = cv(ar[2]); d = cv(ar[3]); } public void Multi(out T a, out U b, out V c, out W d, out X e) { var ar = StrArr; a = cv(ar[0]); b = cv(ar[1]); c = cv(ar[2]); d = cv(ar[3]); e = cv(ar[4]); } } class ReRooting { public int NodeCount { get; private set; } int[][] Adjacents; int[][] IndexForAdjacent; T[] Res; T[][] DP; T Identity; Func Operate; Func OperateNode; public ReRooting(int nodeCount, int[][] edges, T identity, Func operate, Func operateNode) { NodeCount = nodeCount; Identity = identity; Operate = operate; OperateNode = operateNode; List[] adjacents = new List[nodeCount]; List[] indexForAdjacents = new List[nodeCount]; for (int i = 0; i < nodeCount; i++) { adjacents[i] = new List(); indexForAdjacents[i] = new List(); } for (int i = 0; i < edges.Length; i++) { var edge = edges[i]; indexForAdjacents[edge[0]].Add(adjacents[edge[1]].Count); indexForAdjacents[edge[1]].Add(adjacents[edge[0]].Count); adjacents[edge[0]].Add(edge[1]); adjacents[edge[1]].Add(edge[0]); } Adjacents = new int[nodeCount][]; IndexForAdjacent = new int[nodeCount][]; for (int i = 0; i < nodeCount; i++) { Adjacents[i] = adjacents[i].ToArray(); IndexForAdjacent[i] = indexForAdjacents[i].ToArray(); } DP = new T[Adjacents.Length][]; Res = new T[Adjacents.Length]; for (int i = 0; i < Adjacents.Length; i++) DP[i] = new T[Adjacents[i].Length]; if (NodeCount > 1) Initialize(); else if (NodeCount == 1) Res[0] = OperateNode(Identity, 0); } public T Query(int node) => Res[node]; private void Initialize() { int[] parents = new int[NodeCount]; int[] order = new int[NodeCount]; #region InitOrderedTree var index = 0; Stack stack = new Stack(); stack.Push(0); parents[0] = -1; while (stack.Count > 0) { var node = stack.Pop(); order[index++] = node; for (int i = 0; i < Adjacents[node].Length; i++) { var adjacent = Adjacents[node][i]; if (adjacent == parents[node]) continue; stack.Push(adjacent); parents[adjacent] = node; } } #endregion #region fromLeaf for (int i = order.Length - 1; i >= 1; i--) { var node = order[i]; var parent = parents[node]; T accum = Identity; int parentIndex = -1; for (int j = 0; j < Adjacents[node].Length; j++) { if (Adjacents[node][j] == parent) { parentIndex = j; continue; } accum = Operate(accum, DP[node][j]); } DP[parent][IndexForAdjacent[node][parentIndex]] = OperateNode(accum, node); } #endregion #region toLeaf for (int i = 0; i < order.Length; i++) { var node = order[i]; T accum = Identity; T[] accumsFromTail = new T[Adjacents[node].Length]; accumsFromTail[accumsFromTail.Length - 1] = Identity; for (int j = accumsFromTail.Length - 1; j >= 1; j--) accumsFromTail[j - 1] = Operate(DP[node][j], accumsFromTail[j]); for (int j = 0; j < accumsFromTail.Length; j++) { DP[Adjacents[node][j]][IndexForAdjacent[node][j]] = OperateNode(Operate(accum, accumsFromTail[j]), node); accum = Operate(accum, DP[node][j]); } Res[node] = OperateNode(accum, node); } #endregion } }