JAVA CODE GIVES TLE ( Hello Everyone I am new to codeforces. I tried submitting the above code. But I am getting TLE. I am unable to optimize further. Can someone please help. Thanks in Advance)

#	User	Rating
1	ecnerwala	3649
2	Benq	3581
3	orzdevinwang	3570
4	Geothermal	3569
4	cnnfls_csy	3569
6	tourist	3565
7	maroonrk	3531
8	Radewoosh	3521
9	Um_nik	3482
10	jiangly	3468

#	User	Contrib.
1	maomao90	174
2	awoo	164
3	adamant	161
4	TheScrasse	159
5	nor	158
6	maroonrk	156
7	-is-this-fft-	151
8	SecondThread	147
9	orz	146
10	pajenegod	145

import java.io.BufferedReader;↵
import java.io.IOException;↵
import java.io.InputStreamReader;↵
import java.util.ArrayList;↵
import java.util.Arrays;↵
import java.util.HashSet;↵
import java.util.StringTokenizer;↵
↵
public class BertownRoads {↵
static int MAX;↵
static ArrayList<HashSet<Integer>> adj;↵
static boolean[] visited;↵
static int in[];↵
static int low[];↵
static int timer;↵
static boolean hasBridge;↵
static ArrayList<ArrayList<Integer>> edgeList;↵
↵
public BertownRoads(int V) {↵
MAX = V + 1;↵
adj = new ArrayList<HashSet<Integer>>(MAX);↵
visited = new boolean[MAX];↵
in = new int[MAX];↵
low = new int[MAX];↵
hasBridge = false;↵
timer = 0;↵
edgeList = new ArrayList<ArrayList<Integer>>();↵
↵
for (int i = 0; i < MAX; i++) {↵
adj.add(new HashSet<Integer>());↵
}↵
}↵
↵
void dfs(int node, int par) {↵
visited[node] = true;↵
in[node] = timer;↵
low[node] = timer;↵
timer++;↵
for (int child : adj.get(node)) {↵
if (child == par)↵
continue;↵
↵
else if (!visited[child]) {↵
dfs(child, node);↵
if (low[child] > in[node]) {↵
hasBridge = true;↵
return;↵
}↵
edgeList.add(new ArrayList<Integer>(Arrays.asList(node, child)));↵
low[node] = Math.min(low[node], low[child]);↵
}↵
↵
else {↵
low[node] = Math.min(low[node], in[child]);↵
if (in[node] > in[child]) {↵
edgeList.add(new ArrayList<Integer>(Arrays.asList(node, child)));↵
}↵
}↵
}↵
}↵
↵
public static void main(String[] args) throws IOException {↵
BufferedReader read = new BufferedReader(new InputStreamReader(System.in));↵
int n = 0, m = 0, a, b;↵
StringTokenizer st = new StringTokenizer(read.readLine(), " ");↵
while (st.hasMoreTokens()) {↵
n = Integer.parseInt(st.nextToken());↵
m = Integer.parseInt(st.nextToken());↵
}↵
↵
BertownRoads cc = new BertownRoads(n);↵
for (int i = 0; i < m; i++) {↵
st = new StringTokenizer(read.readLine(), " ");↵
while (st.hasMoreTokens()) {↵
a = Integer.parseInt(st.nextToken());↵
b = Integer.parseInt(st.nextToken());↵
adj.get(a).add(b);↵
adj.get(b).add(a);↵
}↵
}↵
↵
cc.dfs(1, -1);↵
if (hasBridge) {↵
System.out.println(0);↵
} else {↵
edgeList.forEach(list -> {↵
StringBuilder sb = new StringBuilder();↵
list.forEach(x -> sb.append(x).append(" "));↵
System.out.println(sb);↵
});↵
}↵
}↵
}↵