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

#include <iostream>

#include <algorithm>

#define N 200007

using namespace std;

int n,k,l,p,q,r,s,f1[N],f2[N],a[N],cnt[N],ans[N];

int find1(int x){return f1[x]==x ? x:f1[x]=find1(f1[x]);}

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

bool cmp(int x,int y){return f1[x]<f1[y];}

int main(){

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

	for(int i=1;i<=n;++i)f1[i]=f2[i]=i;

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

		scanf("%d%d",&p,&q);

		f1[find1(p)]=find1(q);

	}

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

		scanf("%d%d",&r,&s);

		f2[find2(r)]=find2(s);

	}

	for(int i=1;i<=n;++i)f1[i]=find1(i),f2[i]=find2(i);

	for(int i=1;i<=n;++i)a[i]=i;

	sort(a+1,a+n+1,cmp);

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

		int j=i;

		while(j<n && f1[a[j+1]]==f1[a[j]])++j;

		for(int t=i;t<=j;++t)++cnt[f2[a[t]]];

		for(int t=i;t<=j;++t)ans[a[t]]=cnt[f2[a[t]]];

		for(int t=i;t<=j;++t)--cnt[f2[a[t]]];

		i=j;

	}

	for(int i=1;i<=n;++i)printf("%d ",ans[i]);

}