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: N, K, L = [int(x) for x in input().split()]
  in_K = [[int(x) for x in input().split()] for i in range(K)]
  in_L = [[int(x) for x in input().split()] for i in range(L)]
  
  in_K.sort()
  in_L.sort()
  
  ar = {}
  br = {}
  val = 0
  for i in range(K):
      p, q = in_K[i]
      if not p in ar.keys() and not q in ar.keys():
          val += 1
          ar[p] = val
          ar[q] = val
      else:
          if p in ar.keys():
              ar[q] = ar[p]
          else:
              ar[p] = ar[q]
  for i in range(1, N + 1):
      if not i in ar.keys():
          val += 1
          ar[i] = val
  val = 0
  for i in range(L):
      p, q = in_L[i]
      if not p in br.keys() and not q in br.keys():
          val += 1
          br[p] = val
          br[q] = val
      else:
          if p in br.keys():
              br[q] = br[p]
          else:
              br[p] = br[q]
  for i in range(1, N + 1):
      if not i in br.keys():
          val += 1
          br[i] = val
  ab_dict = {}
  for i in range(1, N + 1):
      if not (ar[i], br[i]) in ab_dict.keys():
          ab_dict[(ar[i], br[i])] = 1
      else:
          ab_dict[(ar[i], br[i])] += 1
  ans = []
  for i in range(1, N + 1):
      ans.append(ab_dict[(ar[i], br[i])])
  print(*ans)
  
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"}]