#include <iostream>
#include <vector>
#include <map>
using namespace std;

int n, m1, m2, a, b, cnt;
vector <vector <int>> g1(5e4 + 1);
vector <vector <int>> g2(5e4 + 1);
vector <int> k1(5e4 + 1, 0);
vector <int> k2(5e4 + 1, 0);
map <pair <int, int>, int> m;

void dfs1(int x) {
    if (k1[x]) return;
    k1[x] = cnt;
    for (int i : g1[x]) dfs1(i);
}

void dfs2(int x) {
    if (k2[x]) return;
    k2[x] = cnt;
    for (int i : g2[x]) dfs2(i);
}

int main()
{
    cin >> n >> m1 >> m2;
    for (int i = 0; i < m1; i++) {
        cin >> a >> b;
        g1[a].push_back(b);
        g1[b].push_back(a);
    }
    for (int i = 0; i < m2; i++) {
        cin >> a >> b;
        g2[a].push_back(b);
        g2[b].push_back(a);
    }
    cnt = 0;
    for (int i = 1; i <= n; i++) {
        if (k1[i]) continue;
        cnt++;
        dfs1(i);
    }
    cnt = 0;
    for (int i = 1; i <= n; i++) {
        if (k2[i]) continue;
        cnt++;
        dfs2(i);
    }
    for (int i = 1; i <= n; i++) m[{k1[i], k2[i]}]++;
    for (int i = 1; i <= n; i++) cout << m[{k1[i], k2[i]}] - 1 << " ";
}