using System;
using System.Collections;
using System.Collections.Generic;
using System.Linq;
using System.IO;
using System.Text;
using System.Globalization;
using System.Diagnostics;



class Myon
{
    public Myon() { }
    public static int Main()
    {
        new Myon().calc();
        return 0;
    }

    Scanner cin;

    int N;

    long[,] dp;
    List<int>[] es;
    int[] A;
    int[] B;

    long mod;

    int[] NCNT;
    long[][] LeftMul;
    long[][] RightMul;

    int[,] pos;

    void calc()
    {
        cin = new Scanner();
        N = cin.nextInt();
        mod = cin.nextInt();

        es = new List<int>[N];
        for (int i = 0; i < N; i++)
        {
            es[i] = new List<int>();
        }
        A = new int[N - 1];
        B = new int[N - 1];
        pos = new int[N - 1, 2];

        for (int i = 0; i < N - 1; i++)
        {
            A[i] = cin.nextInt() - 1;
            B[i] = cin.nextInt() - 1;

            pos[i, 0] = es[B[i]].Count;
            pos[i, 1] = es[A[i]].Count;

            es[A[i]].Add(i);
            es[B[i]].Add(i);
        }

        dp = new long[N - 1, 2];
        for (int i = 0; i < N - 1; i++)
        {
            for (int j = 0; j < 2; j++)
            {
                dp[i, j] = -1;
            }
        }

        NCNT = new int[N];
        LeftMul = new long[N][];
        RightMul = new long[N][];

        for (int i = 0; i < N; i++)
        {
            long p = 1;
            foreach (var e2 in es[i])
            {
                if (A[e2] == i) p *= (dfs(e2, 0) + 1);
                else p *= dfs(e2, 1) + 1;
                p %= mod;

            }
            Console.WriteLine(p);
        }

    }


    long dfs(int e, int t)
    {
        if (dp[e, t] != -1) return dp[e, t];
        int pre, a;
        if (t == 0)
        {
            pre = A[e];
            a = B[e];
        }
        else
        {
            pre = B[e];
            a = A[e];
        }



        NCNT[a]++;
        if (NCNT[a] >= 3 && es[a].Count >= 3)
        {
            int len = (int)((es[a].Count));

            if (NCNT[a] == 3)
            {
                LeftMul[a] = new long[len + 1];
                RightMul[a] = new long[len + 1];
                LeftMul[a][0] = 1;
                RightMul[a][len] = 1;

                for (int i = 0; i < es[a].Count; i++)
                {
                    int e2 = es[a][i];
                    long pp;
                    if (A[e2] == a) pp = (dp[e2, 0] + 1);
                    else pp = dp[e2, 1] + 1;
                    LeftMul[a][i + 1] = LeftMul[a][i] * pp;
                    LeftMul[a][i + 1] %= mod;
                }


                for (int i = es[a].Count - 1; i >= 0; i--)
                {
                    int e2 = es[a][i];
                    long pp;
                    if (A[e2] == a) pp = (dp[e2, 0] + 1);
                    else pp = dp[e2, 1] + 1;
                    RightMul[a][i] = RightMul[a][i + 1] * pp;
                    RightMul[a][i] %= mod;
                }
            }


            long p = 1;
            p = LeftMul[a][pos[e, t]] * RightMul[a][pos[e, t] + 1] % mod;

            return dp[e, t] = p;
        }
        else
        {
            long p = 1;
            foreach (var e2 in es[a])
            {
                if (e2 == e) continue;
                if (A[e2] == a) p *= (dfs(e2, 0) + 1);
                else p *= dfs(e2, 1) + 1;
                p %= mod;

            }
            return dp[e, t] = p;
        }
    }



}


class Scanner
{
    string[] s;
    int i;

    char[] cs = new char[] { ' ' };

    public Scanner()
    {
        s = new string[0];
        i = 0;
    }

    public string next()
    {
        if (i < s.Length) return s[i++];
        string st = Console.ReadLine();
        while (st == "") st = Console.ReadLine();
        s = st.Split(cs, StringSplitOptions.RemoveEmptyEntries);
        if (s.Length == 0) return next();
        i = 0;
        return s[i++];
    }

    public int nextInt()
    {
        return int.Parse(next());
    }
    public int[] ArrayInt(int N, int add = 0)
    {
        int[] Array = new int[N];
        for (int i = 0; i < N; i++)
        {
            Array[i] = nextInt() + add;
        }
        return Array;
    }

    public long nextLong()
    {
        return long.Parse(next());
    }

    public long[] ArrayLong(int N, long add = 0)
    {
        long[] Array = new long[N];
        for (int i = 0; i < N; i++)
        {
            Array[i] = nextLong() + add;
        }
        return Array;
    }

    public double nextDouble()
    {
        return double.Parse(next());
    }


    public double[] ArrayDouble(int N, double add = 0)
    {
        double[] Array = new double[N];
        for (int i = 0; i < N; i++)
        {
            Array[i] = nextDouble() + add;
        }
        return Array;
    }
}

class XRand
{
    uint x, y, z, w;


    public XRand()
    {
        init();
    }

    public XRand(uint s)
    {
        init();
        init_xor128(s);
    }

    void init()
    {
        x = 314159265; y = 358979323; z = 846264338; w = 327950288;

    }

    public void init_xor128(uint s)
    {
        z ^= s;
        z ^= z >> 21; z ^= z << 35; z ^= z >> 4;
        z *= 736338717;
    }

    uint next()
    {
        uint t = x ^ x << 11; x = y; y = z; z = w; return w = w ^ w >> 19 ^ t ^ t >> 8;
    }

    public long nextLong(long m)
    {
        return (long)((((ulong)next() << 32) + next()) % (ulong)m);
    }

    public int nextInt(int m)
    {
        return (int)(next() % m);
    }

    public int nextIntP(int a)
    {
        return (int)Math.Pow(a, nextDouble());
    }

    public int nextInt(int min, int max)
    {
        return min + nextInt(max - min + 1);
    }


    public double nextDouble()
    {
        return (double)next() / uint.MaxValue;
    }

    public double nextDoubleP(double a)
    {
        return Math.Pow(a, nextDouble());
    }
}



Measured memory_bytes: 52128