// Slower C++ solution:
#include <iostream>

#include <cstdio>

#include <cstring>

#include <cmath>

#include <algorithm>

#include <vector>

#include <queue>

#include <string>

#include <stack>

#include <map>

#include <ctime>

#include <set>

#include <bitset>

#include <ctime>

#define X first

#define Y second

#define clr(u,v); memset(u,v,sizeof(u));

#define in() freopen("data","r",stdin);

#define out() freopen("data","w",stdout);

#define Clear(Q); while (!Q.empty()) Q.pop();

#define pb push_back

using namespace std;

typedef long long ll;

typedef pair<int, int> pii;

typedef pair<char, int> pci;

const int maxn = 2e5 + 10;

const int INF = 0x3f3f3f3f;

int f[maxn];

int f2[maxn];

int f3[maxn];



int sum[maxn];

void init(int n)

{

    for (int i = 0; i < maxn; i++)

        f[i] = i, f2[i] = i, f3[i] = i, sum[i] = 1;

}

int find(int x)

{

    return f[x] == x ? x : f[x] = find(f[x]);

}

int find2(int x)

{

    return f2[x] == x ? x : f2[x] = find2(f2[x]);

}



int find3(int x)

{

    return f3[x] == x ? x : f3[x] = find3(f3[x]);

}





void mix(int x, int y)

{

    int fx = find(x), fy = find(y);

    if (fx == fy) return ;

    f[fx] = fy;

}

void mix2(int x, int y)

{

    int fx = find2(x), fy = find2(y);

    if (fx == fy) return ;

    f2[fx] = fy;

}

void mix3(int x, int y)

{

    int fx = find3(x), fy = find3(y);

    if (fx == fy) return ;

    f3[fx] = fy;

    sum[fy] += sum[fx];

}

map <pii, int> M;



int main()

{

#ifdef LOCAL

//    in();

#endif

    int n, k, l, a, b;

    scanf("%d%d%d", &n, &k, &l);

    init(n);

    while (k--)

    {

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

        mix(a, b);

    }

    while (l--)

    {

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

        mix2(a, b);

//        else mix3(a,b);

    }

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

        M[make_pair(find(i), find2(i))]++;



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

        printf("%d ", M[make_pair(find(i), find2(i))]);

    puts("");

    return 0;

}


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

#include <cstdio>

#include <cstring>

#include <queue>

#include <map>

#include <vector>

#include <algorithm>

#include <cstdlib>

#include <cmath>

#include <bitset>

#define pb push_back

#define mp make_pair

#define x first

#define y second

#define pii pair<int,int>

#define pdd pair<db,db>



using namespace std;



typedef long long ll;

typedef double db;



const int N = 1e5+10,M=1e4+10,MOD = 1e9+7;



int fa[N*2],fb[2*N];

//int ans[N*2];



void init(int n){

    for(int i=0;i<=n;i++)

        fa[i]=fb[i]=i;

}



int finda(int x){

    if(fa[x]!=x)fa[x]=finda(fa[x]);

    return fa[x];

}

int findb(int x){

    if(fb[x]!=x)fb[x]=findb(fb[x]);

    return fb[x];

}



int main()

{

    int n,k,l;

    while(~scanf("%d%d%d",&n,&k,&l)){

        init(n);

        for(int i=0;i<k;i++){

            int x,y;

            scanf("%d%d",&x,&y);

            int fx=finda(x),fy=finda(y);

            if(fx!=fy)fa[fx]=fy;

        }

        for(int i=0;i<l;i++){

            int x,y;

            scanf("%d%d",&x,&y);

            int fx=findb(x),fy=findb(y);

            if(fx!=fy)fb[fx]=fy;

        }

        map<int,pii> m1;

        map<pii,int> m2;

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

            int xa=finda(i),xb=findb(i);

           //cout<<xa<<" "<<xb<<endl;

            m1[i]=mp(xa,xb);

            m2[mp(xa,xb)]++;

           // cout<<"("<<m1[i].x<<","<<m1[i].y<<") "<<m2[mp(xa,xb)]<<endl<<endl;

        }



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

            cout<<m2[m1[i]]<<" ";

        }

        cout<<endl;

       

    }

}