Given a graph of n vertices and no edge. There are q queries of either form:
1 u v
add an edge between u and v.2 u v
determine whether u and v are connected.YES
if u and v are connected, otherwise print NO
.Input:
6 5
1 1 2
1 1 3
2 2 3
1 5 6
2 4 5
Output:
YES
NO