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

#include <cstdio>

#include <algorithm>

#include <vector>

#include <stack>

#include <queue>

#include <map>

#include <set>

#include <string>

#include <cstring>

#include <bitset>

#define ll long long

#define rep(x,n) for(ll (x)=0;(x)<n;(x)++)

#define rep1(x,n) for(ll (x)=1;(x)<=n;(x)++)

using namespace std;



const ll N=200002;



struct node

{

    int id,pa1,pa2;

    node(int _id=0,int _pa1=0,int _pa2=0)

    {

        id=_id;pa1=_pa1;pa2=_pa2;

    }

    bool operator < (const node b) const

    {

        return pa1<b.pa1;

    }

};



int n,pa1[N],pa2[N],ans[N]={0};

vector<node> S[N];



int fpa1(int x)

{

    return pa1[x]==x?x:pa1[x]=fpa1(pa1[x]);

}



int fpa2(int x)

{

    return pa2[x]==x?x:pa2[x]=fpa2(pa2[x]);

}



int main()

{

    #ifdef LOCAL

        freopen("C_data","r",stdin);

    #endif

    int k,l,a,b;

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

    rep1(i,n) pa1[i]=i,pa2[i]=i;

    while(k--)

    {

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

        if(fpa1(b)!=fpa1(a))

            pa1[fpa1(b)]=fpa1(a);

    }

    while(l--)

    {

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

        if(fpa2(b)!=fpa2(a))

            pa2[fpa2(b)]=fpa2(a);

    }

    rep1(i,n)

    {

        S[fpa2(i)].push_back(node(i,fpa1(i),fpa2(i)));

    }

    rep1(i,n)

    {

        sort(S[i].begin(),S[i].end());

        int st=0;

        while(st<S[i].size())

        {

            int t=st,cnt=1;

            while(t+1<S[i].size() && S[i][t+1].pa1==S[i][t].pa1) t++,cnt++;

            for(int j=st;j<=t;j++)

            {

                ans[S[i][j].id]=cnt;

            }

            st=t+1;

        }

    }

    rep1(i,n) cout<<ans[i]<<' ';

    cout<<endl;

    return 0;

}


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

}