B'This is a hard version of the problem. The only difference between an easy and a hard version is in the number of queries. Polycarp grew a tree from n vertices. We remind you that a tree of n vertices is an undirected connected graph of n vertices and n-1 edges that does not contain cycles. He calls a set of vertices passable if there is such a path in the tree that passes through each vertex of this set without passing through any edge twice. The path can visit other vertices (not from this set). In other words, a set of vertices is called passable if there is a simple path that passes through all the vertices of this set (and possibly some other). For example, for a tree below sets {3, 2, 5 } , {1, 5, 4 } , {1, 4 } are passable, and {1, 3, 5 } , {1, 2, 3, 4, 5 } are not. Polycarp asks you to answer q queries. Each query is a set of vertices. For each query, you need to determine whether the corresponding set of vertices is passable. The first line of input contains a single integer n ( 1 <= n <= 2 cdot 10^5 ) -- number of vertices. Following n - 1 lines a description of the tree.. Each line contains two integers u and v ( 1 <= u, v <= n , u ne v ) -- indices of vertices connected by an edge. Following line contains single integer q ( 1 <= q <= 10^5 ) -- number of queries. The following 2 cdot q lines contain descriptions of sets. The first line of the description contains an integer k ( 1 <= k <= n ) -- the size of the set. The second line of the description contains k of distinct integers p_1, p_2, ... , p_k ( 1 <= p_i <= n ) -- indices of the vertices of the set. It is guaranteed that the sum of k values for all queries does not exceed 2 cdot 10^5 . Output q lines, each of which contains the answer to the corresponding query. As an answer, output "YES" if the set is passable, '...