#include <fstream>
#include <algorithm>
#include <vector>
#include <utility>

#define inf 300001
#define vintp vector<pair<int,int> >::iterator

using namespace std;

ifstream fin ("atac.in");
ofstream fout("atac.out");

vector <pair<int,int> >T[32001];
int rmq[16][32001],t[16][32001],log[32001],L[32001];
int x,y,a,b,c,d,n,m,p,z;

void dfs (int x, int father, int lvl)
{
    L[x] = lvl;

    for (vintp it = T[x].begin (); it != T[x].end (); ++it)
    {
        if (it->first != father)
        {
           t[0][it->first] = x;
           rmq[0][it->first] = it->second;
           dfs (it->first,x,lvl+1);
        }
    }
}

void logs ()
{
    log[1] = 0;
    for (int i=2; i<=n; ++i)
    {
        log[i] = log[i/2]+1;
    }
}

void RMQ ()
{
    for (int i=1; i<=log[n]; ++i)
    {
        for (int j = 1; j<= n; ++j)
        {
            t[i][j] = t[i-1][t[i-1][j]];
            rmq[i][j] = min (rmq[i-1][j],rmq[i-1][t[i-1][j]]);
        }
    }
}

int query (int x, int y)
{
    int val = inf;

    if (L[x] != L[y])
    {
        if (L[x] < L[y])
          swap (x,y);

        int op = L[x] - L[y];

        for (int i=0; i<=log[n]; ++i)
        {
            if ((op>>i)&1)
            {
                val = min (val,rmq[i][x]);
                x = t[i][x];
            }
        }
    }

    if (x == y)
    {
      if (val == inf)
        return 0;
        return val;
    }


    for (int i = log[n]; i>=0; --i)
    {
        if (t[i][x] != t[i][y])
        {
            val = min (val,min(rmq[i][x],rmq[i][y]));
            x = t[i][x];
            y = t[i][y];
        }
    }


    return min (val,min(rmq[0][x],rmq[0][y]));
}

int main()
{
    fin>>n>>m>>p;

    for (int i=2; i<=n; ++i)
    {
        fin>>x>>y;

        T[i].push_back (make_pair(x,y));
        T[x].push_back (make_pair(i,y));
    }

    rmq[0][1] = inf;
    dfs (1,0,1);
    logs ();
    RMQ ();

    fin>>x>>y>>a>>b>>c>>d;

    for (int i=1; i<=m; ++i)
    {
        z = query (x,y);

        if (i >= m-p+1)
        {
            fout<<z<<"\n";
        }

        x = (x*a + y*b) % n + 1;
        y = (y*c + z*d) % n + 1;
    }

    return 0;
}