using System;
using System.Collections.Generic;
using System.Linq;
using static System.Console;
using static System.Convert;
using static System.Math;
//using static System.Globalization.CultureInfo;

class Program
{
    static void Main(string[] args)
    {
        var nkl = Array.ConvertAll(ReadLine().Split(' '), int.Parse);
        var ro = new UnionFind<int>();
        var tr = new UnionFind<int>();
        for(var i = 0; i < nkl[0]; i++)
        {
            ro.MakeSet(i + 1);
            tr.MakeSet(i + 1);
        }
        for(var i = 0; i < nkl[1]; i++)
        {
            var input = Array.ConvertAll(ReadLine().Split(' '), int.Parse);
            ro.Union(input[0], input[1]);
        }
        for(var j = 0; j < nkl[2]; j++)
        {
            var input = Array.ConvertAll(ReadLine().Split(' '), int.Parse);
            tr.Union(input[0], input[1]);
        }
        var pro = new int[nkl[0]];
        var ptr = new int[nkl[0]];
        for(var i = 0; i < nkl[0]; i++)
        {
            pro[i] = ro.parent(i + 1);
            ptr[i] = tr.parent(i + 1);
        }
        var dic = new Dictionary<int, Dictionary<int, int>>();
        for(var i = 0; i < nkl[0]; i++)
        {
            if (!dic.ContainsKey(pro[i]))
                dic[pro[i]] = new Dictionary<int, int>();
            if (dic[pro[i]].ContainsKey(ptr[i]))
                dic[pro[i]][ptr[i]]++;
            else dic[pro[i]][ptr[i]] = 1;
        }
        WriteLine(string.Join(" ", Enumerable.Range(0, nkl[0]).Select(v => dic[pro[v]][ptr[v]])));
    }
    private const string ALFA = "abcdefghijklmnopqrstuvwxyz";
    private const int MOD = 1000000007;
}

public class UnionFind<T>
{
    private class Vertex
    {
        public T Key { get; set; }
        public Vertex Parent { get; set; }
        public int Rank { get; set; }

        public Vertex(T key) : this(key, null, 0)
        {

        }
        public Vertex(T key, Vertex Parent, int rank)
        {
            this.Key = key;
            this.Parent = Parent;
            this.Rank = rank;
        }
    }
    private readonly Dictionary<T, Vertex> dics;
    private readonly Vertex NIL;

    public int Count { get; private set; }

    public UnionFind()
    {
        NIL = new Vertex(default(T));
        dics = new Dictionary<T, Vertex>();
    }

    public T parent(T key)
        => FindSet(dics[key].Parent).Key;

    public bool IsSame(T key1, T key2)
    {
        if (!dics.ContainsKey(key1) || !dics.ContainsKey(key2))
            throw new ArgumentException("対応する頂点が存在しません");
        return ReferenceEquals(FindSet(dics[key1]),FindSet(dics[key2]));
    }

    public bool MakeSet(T key)
    {
        if (dics.ContainsKey(key))
            throw new ArgumentException($"{key}をキーとして持つ頂点が既に存在します");
        dics[key] = new Vertex(key, NIL, 0);
        dics[key].Parent = dics[key];
        Count++;
        return true;
    }

    public bool Union(T key1, T key2)
    {
        if (!dics.ContainsKey(key1) || !dics.ContainsKey(key2))
            throw new ArgumentException("対応する頂点が存在しません");
        if (IsSame(key1, key2)) return false;
        Link(FindSet(dics[key1]), FindSet(dics[key2]));
        Count--;
        return true;
    }

    private bool Link(Vertex vex1, Vertex vex2)
    {
        if (vex1.Rank > vex2.Rank)
            vex2.Parent = vex1;
        else
        {
            vex1.Parent = vex2;
            if (vex1.Rank == vex2.Rank)
                vex2.Rank++;
        }
        return true;
    }

    private Vertex FindSet(Vertex vex)
    {
        if (!ReferenceEquals(vex.Parent, vex))
            vex.Parent = FindSet(vex.Parent);
        return vex.Parent;
    }
}


Measured memory_bytes: 94448