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

#include <stdio.h>

#include <iostream>

#include <string.h>

#include <math.h>

#include <stdlib.h>

#include <limits.h>

#include <algorithm>

#include <queue>

#include <vector>

#include <set>

#include <map>

#include <stack>

#include <bitset>

#include <string>

#include <time.h>

using namespace std;

long double esp=1e-11;

//#pragma comment(linker, "/STACK:1024000000,1024000000")

#define fi first

#define se second

#define all(a) (a).begin(),(a).end()

#define cle(a) while(!a.empty())a.pop()

#define mem(p,c) memset(p,c,sizeof(p))

#define mp(A, B) make_pair(A, B)

#define pb push_back

#define lson l , m , rt << 1

#define rson m + 1 , r , rt << 1 | 1

typedef long long int LL;

const long double PI = acos((long double)-1);

const LL INF=0x3f3f3f3f3f3f3f3fll;

const int MOD =1000000007ll;

const int maxn=210100;

int ro1[maxn];

int up1(int u){return(ro1[u]==u)?u:ro1[u]=up1(ro1[u]);}

int ro2[maxn];

int up2(int u){return(ro2[u]==u)?u:ro2[u]=up2(ro2[u]);}

vector<pair<int,int> >node[maxn];

int c[maxn][2];

int ans[maxn];

int main()

{

    //freopen("in9.txt", "r", stdin);

    //freopen("in9.txt", "r", stdin);

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

    //::iterator iter;                  %I64d

    //for(int x=1;x<=n;x++)

    //for(int y=1;y<=n;y++)

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

    //printf("%d\n",ans);

    int n,k,l;

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

    for(int x=1;x<=n;x++)ro1[x]=ro2[x]=x,node[x].clear();

    for(int x=1;x<=k;x++)

    {

        int u,v;

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

        ro1[up1(u)]=up1(v);

    }

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

        node[up1(x)].pb(mp(x,0));

    for(int x=1;x<=l;x++)

    {

        int u,v;

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

        ro2[up2(u)]=up2(v);

    }

    mem(ans,0);

    mem(c,0);

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

    {

    	for(int y=0;y<node[x].size();y++)

		{

			node[x][y].se=up2(node[x][y].fi);

			if(c[node[x][y].se][1]!=x)

			{

				c[node[x][y].se][1]=x;

				c[node[x][y].se][0]=0;

			}

			c[node[x][y].se][0]++;

		}

		for(int y=0;y<node[x].size();y++)

			ans[node[x][y].fi]=c[node[x][y].se][0];

    }

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

        printf("%d%c",ans[x]," \n"[x==n]);

    return 0;

}


// Faster C++ solution for the same problem (measured speedup: 9.525453061521203x):
#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;

       

    }

}