import java.io.BufferedReader import java.io.InputStream import java.io.InputStreamReader import java.io.PrintWriter import java.util.* class UnionFind(n: Int) { private val rank = IntArray(n) { 0 } private val parent = IntArray(n) { -1 } fun find(x: Int): Int { if (parent[x] < 0) { return x } parent[x] = find(parent[x]) return parent[x] } fun unite(x: Int, y: Int) { val x1 = find(x) val y1 = find(y) if (x1 == y1) { return } if (rank[x1] < rank[y1]) { parent[y1] += parent[x1] parent[x1] = y1 } else { parent[x1] += parent[y1] parent[y1] = x1 if (rank[x1] == rank[y1]) { rank[x1]++ } } } fun same(x: Int, y: Int): Boolean { return find(x) == find(y) } fun size(x: Int): Int { return -parent[find(x)] } } fun PrintWriter.solve(sc: FastScanner) { val n = sc.nextInt() val uf = UnionFind(n) val adj = Array(n) { mutableSetOf() } for (i in 0 until n - 1) { val v1 = sc.nextInt() - 1 val v2 = sc.nextInt() - 1 adj[v1].add(v2) adj[v2].add(v1) uf.unite(v1, v2) } if (uf.size(0) != n) { throw Exception() } val lst = mutableListOf() for (i in 0 until n) { if (adj[i].count() >= 3) { lst.add(i) } } if (lst.count() >= 2) { println("No") } else if (lst.count() == 0) { println("Yes") } else { val lens = mutableSetOf() val que: Queue> = ArrayDeque() que.add(Triple(lst[0], -1, 0)) while (que.count() > 0) { val (v, p, d) = que.poll() var isleaf = true for (w in adj[v]) { if (w != p) { isleaf = false que.add(Triple(w, v, d + 1)) } } if (isleaf) { lens.add(d) } } println(if (lens.count() == 1) "Yes" else "No") } } fun main() { val writer = PrintWriter(System.out, false) writer.solve(FastScanner(System.`in`)) writer.flush() } class FastScanner(s: InputStream) { private var st = StringTokenizer("") private val br = BufferedReader(InputStreamReader(s)) fun next(): String { while (!st.hasMoreTokens()) st = StringTokenizer(br.readLine()) return st.nextToken() } fun nextInt() = next().toInt() fun nextLong() = next().toLong() fun nextLine() = br.readLine() fun nextDouble() = next().toDouble() fun ready() = br.ready() }