// Slower C++ solution:
#include <stdio.h>

#include <string.h>

#include <iostream>

#include <algorithm>

#include <queue>

#include <vector>

#include <string>

#include <set>

#include <map>

#define ll long long

#define ull unsigned long long

#define rep(i, to) for(int i = 0; i < (to); ++i)

#define rep1(i, to) for(int i = 1; i <= (to); ++i)

#define ms(x, v) memset(x, v, sizeof(x))

using namespace std;

const int N = 200005;

int pa1[N], pa2[N];

int fpa1(int x){ return pa1[x] == x ? x : pa1[x] = fpa1(pa1[x]); }

int fpa2(int x){ return pa2[x] == x ? x : pa2[x] = fpa2(pa2[x]); }

void lnk1(int x, int y) {x = fpa1(x), y = fpa1(y); if(x != y) pa1[x] = y;}

void lnk2(int x, int y) {x = fpa2(x), y = fpa2(y); if(x != y) pa2[x] = y;}

int ans[N];

vector<int> v[N];

int main()

{

#ifdef LOCAL

    freopen("in", "r", stdin);

#endif

//    ios::sync_with_stdio(0);

    int n, k, l, a, b;

    while(scanf("%d%d%d", &n, &k, &l) > 0)

    {

        ms(ans, 0);

        rep1(i, n) pa1[i] = pa2[i] = i, v[i].clear();

        rep1(i, k)

        {

            scanf("%d%d", &a, &b);

            lnk1(a, b);

        }

        rep1(i, l)

        {

            scanf("%d%d", &a, &b);

            lnk2(a, b);

        }

        rep1(i, n) v[fpa1(i)].push_back(i);

        rep1(i, n)

        {

            if(v[i].size())

            {

                map<int, int> mp;

                rep(j, (int)v[i].size()) mp[fpa2(v[i][j])]++;

                rep(j, (int)v[i].size())

                {

                    ans[v[i][j]] = mp[fpa2(v[i][j])];

                }

            }

        }

        rep1(i, n) printf("%d ", ans[i]);

        puts("");

    }

    return 0;

}


// Faster C++ solution for the same problem (measured speedup: 7.363755474664652x):
#include <cstdio>

#include <cstdlib>

#include <cstring>

#include <cmath>

#include <algorithm>

#include <assert.h>

#define IOS ios::sync_with_stdio(false)

using namespace std;

#define inf (0x3f3f3f3f)

typedef long long int LL;





#include <iostream>

#include <sstream>

#include <vector>

#include <set>

#include <map>

#include <queue>

#include <string>

#include <bitset>

const int maxn = 2e5 + 20;

int fa[2][maxn];

int getFa(int u, int which) {

    if (fa[which][u] == u) return u;

    else return fa[which][u] = getFa(fa[which][u], which);

}

void toMerge(int x, int y, int which) {

    x = getFa(x, which);

    y = getFa(y, which);

    fa[which][y] = x;

}

map<pair<int, int>, int>al;

void work() {

    int n, k1, k2;

    scanf("%d%d%d", &n, &k1, &k2);

    for (int i = 1; i <= n; ++i) {

        fa[0][i] = fa[1][i] = i;

    }

    for (int i = 1; i <= k1; ++i) {

        int u, v;

        scanf("%d%d", &u, &v);

        toMerge(u, v, 0);

    }

    for (int i = 1; i <= k2; ++i) {

        int u, v;

        scanf("%d%d", &u, &v);

        toMerge(u, v, 1);

    }

    for (int i = 1; i <= n; ++i) {

        al[make_pair(getFa(i, 0), getFa(i, 1))]++;

    }

    for (int i = 1; i <= n; ++i) {

        cout << al[make_pair(getFa(i, 0), getFa(i, 1))] << " ";

    }

}



int main() {

#ifdef local

    freopen("data.txt", "r", stdin);

//    freopen("data.txt", "w", stdout);

#endif

    work();

    return 0;

}