If we assign a value for each edge based on the time it gets added, then node $$$i$$$ contains information $$$j$$$ if and only if the path from $$$i$$$ to $$$j$$$ is decreasing. Thus, it's not hard to figure out "Q" type query (i.e if node $$$i$$$ information $$$j$$$) using LCA/binary lifting. For "C" type query (how many nodes $$$i$$$ contain information $$$j$$$), it seems like we need to go from node $$$j$$$ and see how many nodes $$$i$$$ can be reached using increasing edges. However, this algorithm is clearly too slow and I couldn't figure anything else out.