#include <iostream>
#include <algorithm>
#include <vector>
#include <map>
#include <set>
#include <array>
#include <stack>
#include <queue>
#include <random>
#include <numeric>
#include <chrono>
#include <utility>
#include <iomanip>

using namespace std;

void dbg_out() { cerr << endl; }
template<typename Head, typename... Tail>
void dbg_out(Head H, Tail... T) { cerr << ' ' << H; dbg_out(T...); }
#define dbg(...) cerr << "(" << #__VA_ARGS__ << "):", dbg_out(__VA_ARGS__)

#define rng_init mt19937 rng(chrono::steady_clock::now().time_since_epoch().count())
#define rng_seed(x) mt19937 rng(x)
#define all(x) (x).begin(), (x).end()
#define sz(x) (int) (x).size()
// #define int long long

const int MXN = 1e5 + 1, INF = 1e9 + 1;

struct DSU {
    int n;
    vector<int> info;

    DSU(int n) : n(n) { info.assign(n, -1); }

    int get(int x) {
        if (info[x] < 0) return x;
        return info[x] = get(info[x]);
    }

    void unite(int x, int y) {
        x = get(x), y = get(y);
        if (x == y) return;

        if (info[y] < info[x]) swap(x, y);
        info[x] += info[y];
        info[y] = x;
    }
};

void solve() {
    int N, K, L;
    cin >> N >> K >> L;

    DSU roads(N), railways(N);

    while (K--) {
        int u, v;
        cin >> u >> v;

        roads.unite(u - 1, v - 1);
    }

    while (L--) {
        int u, v;
        cin >> u >> v;

        railways.unite(u - 1, v - 1);
    }

    map<pair<int, int>, int> cnt;

    for (int i = 0; i < N; i++) {
        int roadPar = roads.get(i), railwayPar = railways.get(i);

        cnt[{roadPar, railwayPar}]++;
    }

    for (int i = 0; i < N; i++) {
        int roadPar = roads.get(i), railwayPar = railways.get(i);

        cout << cnt[{roadPar, railwayPar}] << " ";
    }
}

signed main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);

    int TC = 1;
    // cin >> TC;
    while (TC--) solve();
}