// 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.729487932390334x):
#include <iostream>

#include <algorithm>

#include <cstdio>

#include <map>

#define rep(a,b,c) for(int a=b;a<=c;a++)

#define per(a,b,c) for(int a=b;a>=c;a--)

#define MAXN 200005

#define ll long long

using namespace std;

int f1[MAXN],f2[MAXN],res[MAXN];

typedef pair<int,int> pii;

map<pii,int> m;

void init(int n)

{

    rep(i,1,n)

        f1[i] = f2[i] = i,res[i] =1;

}

int getf(int x,int f[])

{

    if(x != f[x])

        f[x] = getf(f[x],f);

    return f[x];

}

void Union(int a,int b,int f[])

{

    a = getf(a,f);

    b = getf(b,f);

    if(a != b){

        f[a] = f[b];

    }

}

bool isSame(int a,int b,int f[])

{

    return getf(a,f) == getf(b,f);

}

int main()

{

    //freopen("data","r",stdin);

    int n,k,l;

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

    init(n);

    int a,b;

    rep(i,1,k)

    {

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

        Union(a,b,f1);

    }

    rep(i,1,l)

    {

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

        Union(a,b,f2);

    }

    rep(i,1,n){

        m[make_pair(getf(i,f1),getf(i,f2))]++;

    }

    rep(i,1,n)

    {

        printf("%d ",m[make_pair(getf(i,f1),getf(i,f2))]);

    }

    return 0;

}