output_description: Print N integers. The i-th of them should represent the number of the cities
  connected to the i-th city by both roads and railways.
  
  * * *
input_description: The input is given from Standard Input in the following format:
  
      
      
      N K L
      p_1 q_1
      :
      p_K q_K
      r_1 s_1
      :
      r_L s_L
attempt: def f(m, r):
      connmap = [[] for _ in range(m + 1)]
      for _ in range(r):
          a, b = map(int, input().split())
          connmap[a].append(b)
          connmap[b].append(a)
      group = [0] * (m + 1)
      num = 0
      for i in range(1, m + 1):
          if group[i] > 0:
              continue
          if len(connmap[i]) == 0:
              continue
          num += 1
          group[i] = num
          for j in connmap[i]:
              group[j] = num
          bfs = connmap[i]
          while len(bfs) > 0:
              tmp = []
              for j in bfs:
                  for k in connmap[j]:
                      if group[k] > 0:
                          continue
                      group[k] = num
                      tmp.append(k)
              bfs = tmp
      return group
  
  
  n, k, l = map(int, input().split())
  
  road = f(n, k)
  rail = f(n, l)
  
  count = {}
  
  for i in range(1, n + 1):
      key = "{0} {1}".format(road[i], rail[i])
      if key in count:
          count[key] += 1
      else:
          count[key] = 1
  
  for i in range(1, n + 1):
      key = "{0} {1}".format(road[i], rail[i])
      print(count[key], end=" " if i < n else "")
  print()
  
problem_description: Statement
  
  There are N cities. There are also K roads and L railways, extending between
  the cities. The i-th road bidirectionally connects the p_i-th and q_i-th
  cities, and the i-th railway bidirectionally connects the r_i-th and s_i-th
  cities. No two roads connect the same pair of cities. Similarly, no two
  railways connect the same pair of cities.
  
  We will say city A and B are _connected by roads_ if city B is reachable from
  city A by traversing some number of roads. Here, any city is considered to be
  connected to itself by roads. We will also define _connectivity by railways_
  similarly.
  
  For each city, find the number of the cities connected to that city by both
  roads and railways.
samples: [{"input": "4 3 1\n    1 2\n    2 3\n    3 4\n    2 3", "output": "1 2 2 1\n    \n\nAll the four cities are connected to each other by roads.\n\nBy railways, only the second and third cities are connected. Thus, the answers\nfor the cities are 1, 2, 2 and 1, respectively.\n\n* * *"}, {"input": "4 2 2\n    1 2\n    2 3\n    1 4\n    2 3", "output": "1 2 2 1\n    \n\n* * *"}, {"input": "7 4 4\n    1 2\n    2 3\n    2 5\n    6 7\n    3 5\n    4 5\n    3 4\n    6 7", "output": "1 1 2 1 2 2 2"}]