#include <array>
#include <iostream>
#include <map>
#include <vector>

using namespace std;

void dfs(
    vector<vector<int>> const& graph,
    vector<bool>& done,
    vector<int>& component,
    int const cur,
    int const start
) {
    done[cur] = true;
    component[cur] = start;

    for (int const& neigh : graph[cur]) {
        if (done[neigh])
            continue;

        dfs(graph, done, component, neigh, start);
    }
}

int main() {
    array<int, 2> edge_count;

    int n;
    cin >> n >> edge_count[0] >> edge_count[1];

    vector graph(2, vector(n, vector<int>()));

    for (int i = 0; i < 2; i++) {
        for (int j = 0; j < edge_count[i]; j++) {
            int u, v;
            cin >> u >> v;
            u--; v--;

            graph[i][u].push_back(v);
            graph[i][v].push_back(u);
        }
    }

    vector components(2, vector<int>(n));

    for (int i = 0; i < 2; i++) {
        vector<bool> done(n);

        for (int j = 0; j < n; j++)
            if (!done[j])
                dfs(graph[i], done, components[i], j, j);
    }

    map<pair<int, int>, int> cp;

    for (int i = 0; i < n; i++)
        cp[{ components[0][i], components[1][i] }]++;

    for (int i = 0; i < n; i++)
        cout << cp[{ components[0][i], components[1][i] }] - 1 << " ";
    cout << "\n";
}