Problem:
Score : 400 points

Problem 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.

Constraints

2 ≦ N ≦ 2*10^5

1 ≦ K, L≦ 10^5

1 ≦ p_i, q_i, r_i, s_i ≦ N

p_i < q_i

r_i < s_i

When i ≠ j, (p_i, q_i) ≠ (p_j, q_j)

When i ≠ j, (r_i, s_i) ≠ (r_j, s_j)

Input

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

Output

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.

Sample Input 1

4 3 1
1 2
2 3
3 4
2 3

Sample Output 1

1 2 2 1

All the four cities are connected to each other by roads.

By railways, only the second and third cities are connected. Thus, the answers for the cities are 1, 2, 2 and 1, respectively.

Sample Input 2

4 2 2
1 2
2 3
1 4
2 3

Sample Output 2

1 2 2 1

Sample Input 3

7 4 4
1 2
2 3
2 5
6 7
3 5
4 5
3 4
6 7

Sample Output 3

1 1 2 1 2 2 2

Solution in C# (Mono 4.6.2.0) (judge verdict: Wrong Answer)

using System;
using System.Collections.Generic;
using System.Collections;
using System.Linq;
using System.Numerics;




namespace contest
{

    class contest
    {


        static void Main(string[] args)
        {


            //int n = int.Parse(Console.ReadLine());
            //var input = Console.ReadLine().Split().Select(int.Parse).ToArray();

            //var num = Console.ReadLine().Split().Select(int.Parse).ToArray();



            //int n = int.Parse(Console.ReadLine());


            //int n = int.Parse(Console.ReadLine());
            //var array = Console.ReadLine().Split().Select(int.Parse).ToArray();


            var num = Console.ReadLine().Split().Select(int.Parse).ToArray();
            int n = num[0];
            int k = num[1];
            int l = num[2];

            var path = new Dictionary<int, HashSet<int>>();
            var rail = new Dictionary<int, HashSet<int>>();
            

            for(int i=0; i<k; i++)
            {
                var tmp = Console.ReadLine().Split().Select(int.Parse).ToArray();
                int a = tmp[0];
                int b = tmp[1];

                if (!path.Keys.Contains(a)) path[a] = new HashSet<int>();
                if (!path.Keys.Contains(b)) path[b] = new HashSet<int>();

                path[a].Add(b);
                path[b].Add(a);
            }

            for (int i = 0; i < l; i++)
            {
                var tmp = Console.ReadLine().Split().Select(int.Parse).ToArray();
                int a = tmp[0];
                int b = tmp[1];

                if (!rail.Keys.Contains(a)) rail[a] = new HashSet<int>();
                if (!rail.Keys.Contains(b)) rail[b] = new HashSet<int>();

                rail[a].Add(b);
                rail[b].Add(a);

            }

            var memo = new bool[n+1];
            
            var node = new UnionFind(n+1);
            

            for(int i=1; i<= n; i++)
            {
                int cur = i;
                if (memo[cur]) continue;
                
                
                var st = new Stack<int>();
                st.Push(cur);
                memo[cur] = true;
                

                while(st.Count()>0)
                {
                    int tmp = st.Pop();
                    if (!path.Keys.Contains(tmp)) continue;
                    foreach(int item in path[tmp])
                    {
                        if(!memo[item])
                        {
                            st.Push(item);
                            
                            node.unitePath(item, tmp);
                            memo[item] = true;
                        }
                    }

                }

                
            }


            memo = new bool[n + 1];
            

            for (int i = 1; i <= n; i++)
            {
                int cur = i;
                if (memo[cur])
                {
                    
                    continue;
                }

                var st = new Stack<int>();
                st.Push(cur);
                memo[cur] = true;
                

                while (st.Count() > 0)
                {
                    int tmp = st.Pop();
                    if (!rail.Keys.Contains(tmp)) continue;
                    foreach (int item in rail[tmp])
                    {
                        if (!memo[item])
                        {
                            st.Push(item);
                            
                            node.uniteRail(item, tmp);
                            memo[item] = true;
                        }
                    }

                }


            }


            
            for (int i = 1; i < n+1 ; i++)
            {
                node.Add(i);
            }

            for(int i=1; i< n+1; i++)
            {
                
                Console.Write(node.Output(i) +" ");
            }





        }

       
       

    }

 
    //class Node
    //{
    //    public int count;
    //    public int pathParent;
    //    public int railParent;
    //    public HashSet<int> pathGraph;
    //    public HashSet<int> railGraph;

    //    public Node()
    //    {
    //        this.count = 0;
    //        this.pathParent = 0;
    //        this.railParent = 0;
    //        this.pathGraph = new HashSet<int>();
    //        this.railGraph = new HashSet<int>();
    //    }

    //    public int Calc()
    //    {
    //        pathGraph.IntersectWith(railGraph);            
    //        return count = pathGraph.Count();
    //    }

    //    public bool Check()
    //    {
    //        if (count == 0) return false;
    //        else return true;
    //    }
    //}

    class UnionFind
    {
        private int[] path;
        private int[] rail;
        public int[] count;
        public bool[] check;

        public UnionFind(int n)
        {
            path = new int[n];
            rail = new int[n];
            count = new int[n];
            check = new bool[n];
            for (int i = 0; i < n; i++)
            {
                path[i] = i;
                rail[i] = i;
                
            }
            
        
        }

        private int rootPath(int i)
        {
            while(i != path[i])
            {
                path[i] = path[path[i]];
                i = path[i];
            }
            return i;
        }

        private int rootRail(int i)
        {
            while(i != rail[i])
            {
                rail[i] = rail[rail[i]];
                i = rail[i];
            }
            return i;
        }

        public bool findPath(int p, int q)
        {
            return rootPath(p) == rootPath(q);
        }

        public bool findRail(int p, int q)
        {
            return rootRail(p) == rootRail(q);
        }






        public void Add(int p)
        {
            int a = path[rail[p]];
            int b = path[p];
            
            if (findPath(a,b))
            {
                count[rail[p]]++;                
                check[p] = true;
            }
            else count[p] = 1;
        }

        public int Output(int i)
        {
            return check[i]? count[rail[i]] : count[i];
        }

        

        public void unitePath(int p , int q)
        {
            int i = rootPath(p);
            int j = rootPath(q);
            path[i] = j;
        }

        public void uniteRail(int p, int q)
        {
            int i = rootRail(p);
            int j = rootRail(q);
            rail[i] = j;
        }
    }
}