#include <iostream>
#include <fstream>
#include <vector>
#include <cmath>

///#include <PRACTICE>
///#include <tryhardmode>

using namespace std;

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

const int NMAX=32e3+5;
const int INF=1e9;

vector<int>v[NMAX];

int rmq[20][NMAX];
int t[20][NMAX];
int lvl[NMAX];
int n,m;

void dfs(int p,int tata)
{
    lvl[p]=tata;
    for(auto i:v[p])
        dfs(i,tata+1);
}

void RMQ()
{
    int e,i;
    //int l=(int(log2(n)));
    for(e=1;(1<<e)<=n;e++)
    {
        for(i=1;i<=n;i++)
        {
            t[e][i]=t[e-1][t[e-1][i]];
			rmq[e][i]=min(rmq[e-1][i],rmq[e-1][t[e-1][i]]);
        }
    }
}

int solve(int x,int y)
{
    int e,i;
    int kon=INF;
    //int l=(int(log2(n)));
    if(lvl[y]<lvl[x])
        swap(x,y);
    for(e=15;e>=0;e--)
    {
        if(lvl[t[e][y]]<lvl[x])
            continue;
        kon=min(kon,rmq[e][y]);
        y=t[e][y];
    }
    for(e=15;e>=0;e--)
    {
        if(t[e][x]!=t[e][y])
        {
            kon=min(kon,rmq[e][x]);
            kon=min(kon,rmq[e][y]);
			x=t[e][x];
			y=t[e][y];
        }
    }
    if(x!=y)
    {
        kon=min(kon,rmq[0][x]);
		kon=min(kon,rmq[0][y]);
    }
    return kon;
}

int main()
{
    int p,i,j,x,y;
    fin>>n>>m>>p;
    for(i=2;i<=n;i++)
    {
        fin>>x>>y;
        v[x].push_back(i);
        rmq[0][i]=y;
        t[0][i]=x;
    }
    RMQ();
    dfs(1,0);
    int a,b,c,d,z;
    fin>>x>>y>>a>>b>>c>>d;
    for(i=1;i<=m;i++)
    {
        if(x==y)
            z=0;
        else
            z=solve(x,y);
        if(i>m-p)
            fout<<z<<"\n";
		x=(x*a+y*b)%n+1;
		y=(y*c+z*d)%n+1;
    }
    return 0;
}