CSES - Path Queries

Explanation: CPH 18.2

Time Complexity: $(N+Q)\log N$

Code: Assumes that dfs() code is included.

#include <bits/stdc++.h>
using namespace std;
 
using ll = long long;
using ld = long double;
using db = double; 
using str = string; // yay python!

using pi = pair<int,int>;
using pl = pair<ll,ll>;