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



using namespace std;



const int inf = 0x3f3f3f3f;

const int maxv = 200010;

const int maxe = 100010;

int vertex, RailEdge, RoadEdge, cnt;

int RailHead[maxv], RoadHead[maxv], number[maxv], ans[maxv];

bool vis[maxv];

vector <int> v[maxv];

struct Edge

{

    int to, next;

}e[maxe * 4];



void addEdge(int *head, int from, int to)

{

    e[cnt].next = head[from];

    e[cnt].to = to;

    head[from] = cnt++;

}



void getNumberDFS(int cur)

{

    vis[cur] = true;

    number[cur] = cnt;

    for (int i = RoadHead[cur]; ~i; i = e[i].next)

    {

        int to = e[i].to;

        if (!vis[to])

            getNumberDFS(to);

    }

}



vector <int> valid;



void DFS(int cur)

{

    vis[cur] = true;

    int curNumber = number[cur];

    if (v[curNumber].size() == 0)

        valid.push_back(curNumber);

    v[curNumber].push_back(cur);

    for (int i = RailHead[cur]; ~i; i = e[i].next)

    {

        if (!vis[e[i].to])

            DFS(e[i].to);

    }

}



int main()

{

    memset(RailHead, -1, sizeof(RailHead));

    memset(RoadHead, -1, sizeof(RoadHead));

    for (int i = 0; i < maxv; i++)

        ans[i] = 1;





    int from, to;

    scanf("%d %d %d", &vertex, &RoadEdge, &RailEdge);

    for (int i = 0; i < RoadEdge; i++)

    {

        scanf("%d %d", &from, &to);

        addEdge(RoadHead, from, to);

        addEdge(RoadHead, to, from);

    }

    for (int i = 0; i < RailEdge; i++)

    {

        scanf("%d %d", &from, &to);

        addEdge(RailHead, from, to);

        addEdge(RailHead, to, from);

    }

    cnt = 0;

    for (int i = 1; i <= vertex; i++)

    {

        if (!vis[i])

        {

            getNumberDFS(i);

            cnt++;

        }

    }

//    printf("number:\n");

//    for (int i = 1; i <= vertex; i++)

//        printf("%d%c", number[i], i == vertex ? '\n' : ' ');

    memset(vis, false, sizeof(vis));

    for (int i = 1; i <= vertex; i++)

    {

        if (!vis[i])

        {

            DFS(i);

            for (int i = 0; i < valid.size(); i++)

            {

                int id = valid[i];

                for (int j = 0; j < v[id].size(); j++)

                    ans[v[id][j]] += v[id].size() - 1;

                v[id].clear();

            }

            valid.clear();

        }

    }

//    printf("answer:\n");

    for (int i = 1; i <= vertex; i++)

        printf("%d%c", ans[i], i == vertex ? '\n' : ' ');

    return 0;

}

/*

7 5 5

1 2

2 3

2 5

6 7

5 6

3 5

4 5

3 4

6 7

5 6

 

 1 1 4 1 4 4 4

 */






// Faster C++ solution for the same problem (measured speedup: 9.309856921661812x):
#include <bits/stdc++.h>

 

using namespace std;

 

typedef long long ll;

 

const int MAXN = 2e5+7;

const int Inf = 0x3f3f3f3f;

 

int pre1[MAXN],pre2[MAXN];

 

int finds(int x,int *pre)

{

    return pre[x] == x? pre[x]:pre[x] = finds(pre[x],pre);

}

 

void join(int x,int y,int *pre)

{

    int px = finds(x,pre);

    int py = finds(y,pre);

    if( px!=py)

    {

        pre[px] = py;

    }

}

int main()

{

    int n,k,l;

    cin>>n>>k>>l;

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

        pre1[i] = i,pre2[i] = i;

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

    {

        int x,y;

        cin>>x>>y;

        join(x,y,pre1);

    }

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

    {

        int x,y;

        cin>>x>>y;

        join(x,y,pre2);

    }

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

    {

        finds(i,pre1);

        finds(i,pre2);

    }

    map<pair<int,int>,int> mp;

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

    {

        //cout<<pre1[i]<<" | "<<pre2[i]<<endl;

        mp[make_pair(pre1[i],pre2[i])] ++;

    }

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

    {

        cout<<mp[make_pair(pre1[i],pre2[i])]<<" ";

    }

    cout<<endl;

}