At Coder Disjoint Set Union- TLE

Question

TLEになります。どこが遅いでしょうか？

def search(u, v):
	if vertices[u] == vertices[v]:
		return 1
	else:
		return 0

def add_edge(u, v):
	x = vertices[u]
	for i in range(N):
		if vertices[i] == x:
			vertices[i] = vertices[v]

N, Q = map(int, input().split())
vertices = [i for i in range(N)]

for _ in range(Q):
	t, u, v = map(int, input().split())
	if t == 0:
		if search(u, v) == 0:
			add_edge(u, v)
			
	else:
		print(search(u, v))
		

Answer 1

add_edgeが配列全体をループしてるので遅くなってます。