// 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.600064772141652x):
#include <cstdio>

#include <algorithm>

#include <map>

#include <iostream>

using namespace std;

#define x first

#define y second

#define mp make_pair

#define REP(i,j,k)  for(int i = (j); i <= (k); ++i)

#define REPD(i,j,k) for(int i = (j); i >= (k); --i)

#define IOS ios::sync_with_stdio(0);cin.tie(0);





const int maxn = 3e5;



int f[maxn];

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



void go(int n,int m,int a[])

{

	REP(i,1,n)

		f[i]=i;

	while(m--)

	{

		int x,y;

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

		if(find(x)!=find(y))

			f[find(x)]=find(y);

	}

	REP(i,1,n)

		a[i]=find(i);

}

int a[maxn],b[maxn];

map<pair<int,int>,int> tot;

int init()

{

	int n,m,p;

	if(scanf("%d%d%d",&n,&m,&p)==EOF) return 0;

	go(n,m,a);

	go(n,p,b);

	tot.clear();

	REP(i,1,n)

		if(tot.count(mp(a[i],b[i]))==0)

			tot[mp(a[i],b[i])]=1;

		else ++tot[mp(a[i],b[i])];

	REP(i,1,n)

		if(i==n)

			printf("%d\n",tot[mp(a[i],b[i])]);

		else printf("%d ",tot[mp(a[i],b[i])]);

	return 1;

}



void solve()

{

}



int main()

{

	IOS

	

	while(init())

	solve();

	

	return 0;

}