It's silly to hop into Union-Find at this level if you haven't been exposed to it.

Here is a simple DFS solution.

class Solution:
    def findProvinces(self, isConnected):
	    def dfs(node):
	      visited[node] = True
	      for neighbor in range(n):
		      if isConnected[node][neighbor] == 1 and not visited[neighbor]:
						dfs(neighbor)

			provinces = 0
			n = len(isConnected)
			visited = [False]*n
			for i in range(n):
				if not visited[i]:
					dfs(i)
					provinces += 1
		return provinces