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=map(int,input().split())
  len = [[[] for s in range(N)] for t in range (2)]
  i=1
  j=1
  while i <= K:
      a,b=map(int,input().split())
      len[0][a-1].append(b-1)
      len[0][b-1].append(a-1)
      i+=1
  
  while j <= L:
      a,b=map(int,input().split())
      len[1][a-1].append(b-1)
      len[1][b-1].append(a-1)
      j+=1
  
  def add(z,n):
      for num1 in len[z][n]:
          for num2 in len[z][num1]:
              if num2 != n and num2 not in len[z][n]:
                  len[z][n].append(num2)
                  add(z,num2)
  n=0
  while n < N:
  	add(0,n)
      add(1,n)
      n+=1
  
  n=0
  answer=[1]*N
  while n < N:
      for point in len[0][n]:
          if point in len[1][n]:
              answer[n]+=1
      n+=1
  
  n=0
  while n<N-1:
      print(answer[n],end=' ')
      n+=1
  print(answer[N-1])
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"}]