I have not went through your code, but see suppose you have

vector<int>graph[N]

, as graph adjacency list representation of graph and N is of 1e5 order. You have made it global.

Clearing it whole for each case till N may give you TLE.

But if you clear it till your required input n, then it may not give TLE.

I have faced TLE lot of time because of clearing everytime time for whole graph.

So either clear till n(given input size) or make it local and pass it by reference in required helper functions.

Sorry I havent seen your code, I will see it later.