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 Java8 (OpenJDK 1.8.0) (judge verdict: Time Limit Exceeded)

import java.io.File;
import java.io.FileNotFoundException;
import java.io.IOException;
import java.io.InputStream;
import java.util.*;

class UnionFindTree {
    int[] par;
    int[] rank;
    int[] size;

    UnionFindTree(int maxSize) {
        par = new int[maxSize];
        rank = new int[maxSize];
        size = new int[maxSize];
        for (int i = 0; i < maxSize; i++) {
            par[i] = i;
            size[i] = 1;
        }
    }

    public int find(int x) {
        if (par[x] == x) {
            return x;
        } else {
            return par[x] = find(par[x]);
        }
    }

    public void unite(int x, int y) {
        x = find(x);
        y = find(y);

        if (x == y)
            return;

        if (rank[x] < rank[y]) {
            par[x] = y;
            size[y] += size[x];
        } else {
            par[y] = x;
            size[x] += size[y];
            if (rank[x] == rank[y])
                rank[x]++;
        }
    }

    public boolean same(int x, int y) {
        return find(x) == find(y);
    }

    public int size(int x) {
        return size[find(x)];
    }
}

class FastScanner {
    private final InputStream in = System.in;
    private final byte[] buffer = new byte[1024];
    private int ptr = 0;
    private int buflen = 0;

    private boolean hasNextByte() {
        if (ptr < buflen) {
            return true;
        } else {
            ptr = 0;
            try {
                buflen = in.read(buffer);
            } catch (IOException e) {
                e.printStackTrace();
            }
            if (buflen <= 0) {
                return false;
            }
        }
        return true;
    }

    private int readByte() {
        if (hasNextByte())
            return buffer[ptr++];
        else
            return -1;
    }

    private static boolean isPrintableChar(int c) {
        return 33 <= c && c <= 126;
    }

    public boolean hasNext() {
        while (hasNextByte() && !isPrintableChar(buffer[ptr]))
            ptr++;
        return hasNextByte();
    }

    public String next() {
        if (!hasNext())
            throw new NoSuchElementException();
        StringBuilder sb = new StringBuilder();
        int b = readByte();
        while (isPrintableChar(b)) {
            sb.appendCodePoint(b);
            b = readByte();
        }
        return sb.toString();
    }

    public long nextLong() {
        if (!hasNext())
            throw new NoSuchElementException();
        long n = 0;
        boolean minus = false;
        int b = readByte();
        if (b == '-') {
            minus = true;
            b = readByte();
        }
        if (b < '0' || '9' < b) {
            throw new NumberFormatException();
        }
        while (true) {
            if ('0' <= b && b <= '9') {
                n *= 10;
                n += b - '0';
            } else if (b == -1 || !isPrintableChar(b)) {
                return minus ? -n : n;
            } else {
                throw new NumberFormatException();
            }
            b = readByte();
        }
    }

    public int nextInt() {
        long nl = nextLong();
        if (nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE)
            throw new NumberFormatException();
        return (int) nl;
    }

    public double nextDoutble() {
        return Double.parseDouble(next());
    }
}

public class Main {
    public static void main(String[] args) {
        
        FastScanner fs = new FastScanner();
        int n = fs.nextInt();
        int k = fs.nextInt();
        int l = fs.nextInt();
        UnionFindTree roadTree = new UnionFindTree(n);
        UnionFindTree railwayTree = new UnionFindTree(n);
        int s,t;
        for(int i=0;i<k;i++){
            s = fs.nextInt()-1;
            t = fs.nextInt()-1;
            roadTree.unite(s,t);
        }
        for(int i=0;i<l;i++){
            s = fs.nextInt()-1;
            t = fs.nextInt()-1;
            railwayTree.unite(s,t);
        }
        Map<Pair<Integer,Integer>,Integer> map = new HashMap<>();
        Integer tmp;
        Pair<Integer,Integer> pair;
        List<Pair<Integer,Integer>> list = new ArrayList<>();
        for(int i=0;i<n;i++){
            pair = new Pair<>(roadTree.find(i),railwayTree.find(i));
            list.add(pair);
            tmp = map.containsKey(pair) ? map.get(pair) : 0;
            map.put(pair,tmp+1);
        }
        StringJoiner sj = new StringJoiner(" ");
        for(int i=0;i<n;i++){
            sj.add(String.valueOf(map.get(list.get(i))));
        }
        System.out.println(sj.toString());
    }
}
class Pair<K,V> {
    public final K first;
    public final V second;
    Pair(K first,V second){
        this.first = first;
        this.second = second;
    }

    @Override
    public boolean equals(Object obj){
        
        if(!(obj instanceof Pair)){
            return false;
        }else{
            Pair<?,?> p = (Pair<?,?>)obj;
            return this.first.equals(p.first)  && this.second.equals(p.second);
        }
    }
    @Override
    public int hashCode(){
        return first.hashCode()^second.hashCode();
    }
}