import
java.util.*;
class
GFG
{
static
class
pair
{
int
first, second;
public
pair(
int
first,
int
second)
{
this
.first = first;
this
.second = second;
}
}
static
void
init(
int
degree[],
pair[] edges,
int
n)
{
for
(
int
i =
0
; i < n; i++)
{
degree[i] =
0
;
}
for
(
int
i =
0
; i < edges.length; i++)
{
degree[edges[i].first]++;
degree[edges[i].second]++;
}
}
static
void
performQueries(pair [] edges,
int
[]q,
int
n)
{
int
[]degree =
new
int
[n];
init(degree, edges, n);
for
(
int
i =
0
; i < q.length; i++)
{
int
node = q[i];
if
(node ==
0
)
{
System.out.println(
"No"
);
continue
;
}
if
(degree[node] ==
1
)
System.out.println(
"Yes"
);
else
System.out.println(
"No"
);
}
}
public
static
void
main(String[] args)
{
int
n =
6
;
pair[] edges = {
new
pair(
0
,
1
),
new
pair(
0
,
2
),
new
pair(
1
,
3
),
new
pair(
1
,
4
),
new
pair(
4
,
5
)};
int
[]q = {
0
,
3
,
4
,
5
};
performQueries(edges, q, n);
}
}