Can someone please tell me why this submission 90262228 of 0-1 MST problem (1243D - 0-1 MST) is giving runtime error on test #25? Thanks

Recently i was giving a competition, specifically Codeforces round #647 div 2 and in the problem B (1362B - Джонни и его хобби), I thought the brute force approach would give TLE, as the complexity was O((n^2)logn) and combined with number of test cases it would give operations of nearly 10^10, which wont fit 1 second time. But at last i submitted the bruteforce and it passes the pretests. So, i just want to know if the number of test cases has any effect on the overall time complexity of the program. Thank you.