B'She does her utmost to flawlessly carry out a person 's last rites and preserve the world 's balance of yin and yang. Hu Tao, being the little prankster she is, has tried to scare you with this graph problem! You are given a connected undirected graph of n nodes with m edges. You also have q queries. Each query consists of two nodes a and b . Initially, all edges in the graph have a weight of 0 . For each query, you must choose a simple path starting from a and ending at b . Then you add 1 to every edge along this path. Determine if it 's possible, after processing all q queries, for all edges in this graph to have an even weight. If so, output the choice of paths for each query. If it is not possible, determine the smallest number of extra queries you could add to make it possible. It can be shown that this number will not exceed 10^{18} under the given constraints. A simple path is defined as any path that does not visit a node more than once. An edge is said to have an even weight if its value is divisible by 2 . The first line contains two integers n and m ( 2 <= q n <= q 3 cdot 10^5 , n-1 <= q m <= q min{ <= ft( frac{n(n-1)}{2}, 3 cdot 10^5 right)} ). Each of the next m lines contains two integers x and y ( 1 <= q x, y <= q n , x neq y ) indicating an undirected edge between node x and y . The input will not contain self-loops or duplicate edges, and the provided graph will be connected. The next line contains a single integer q ( 1 <= q q <= q 3 cdot 10^5 ). Each of the next q lines contains two integers a and b ( 1 <= q a, b <= q n, a neq b ), the description of each query. It is guaranteed that nq <= q 3 cdot 10^5 . If it is possible to force all edge weights to be even, print "YES" on the first line, followed by 2q lines indicating the choice of path for each query in the same '...