Can someone please help me fill in the JAVA code that's missing $($dset$,$ find function, the union function and the pair$)$

import java.util.$*$;

import java.io$.*$;

public class Main $\{$

public static int n;

public static int e;

public static ArrayList$[]$ graph;

public static void main$($String$[]$ args$)\{$

$//$ TODO Auto$-$generated method stub

Scanner scanner $=$ new Scanner$($System$.$in$)$;

$//$Read data

n $=$ scanner.nextInt$()$;

e $=$ scanner.nextInt$()$;

graph $=$ new ArrayList$[$n$]$;

for$($int i $=0$; i$()$;

$//$Read edges

for$($int i $=0$; i $<$ e; i$++)\{$

int v$1=$ scanner.nextInt$()-1$;

int v$2=$ scanner.nextInt$()-1$;

graph$[$v$1].$add$($v$2)$;

graph$[$v$2].$add$($v$1)$;

$\}$

$//$ store items to be removed

int$[]$ remList $=$ new int$[$n$]$;

for$($int i$=0$; i$=0$; i$--)\{$

int item $=$ remList$[$i$]$;

for $($int j $=0$; j