#include <bits/stdc++.h>

using namespace std;
ifstream fin("atac.in");
ofstream fout("atac.out");
#define INF 0x3f3f3f3f
int rmq[16][32010],anc[16][32010],d[32010],depthmax;
vector<int> v[32010];
void dfs(int x, int depth)
{
    depthmax=max(depthmax,depth);
    d[x]=depth;
    for(auto it:v[x])dfs(it,depth+1);
}
int solve(int x, int y)
{
    int dif,i,min1;
    if(d[x]>d[y]) swap(x,y);
    dif=d[y]-d[x];
    min1=INF;
    for(i=0; (1<<i)<=dif; ++i)
    {
        if(dif&(1<<i))
        {
            min1=min(min1,rmq[i][y]);
            y=anc[i][y];
        }
    }
    for(i=15; i>=0; --i)
    {
        if(anc[i][x]!=anc[i][y])
        {
            min1=min(min1,min(rmq[i][x],rmq[i][y]));
            x=anc[i][x];
            y=anc[i][y];
        }
    }
    if(x!=y) min1=min(min1,min(rmq[0][x],rmq[0][y]));
    if(min1==INF) min1=0;
    return min1;
}

int main()
{
    int i,n,m,nr,aux,auxst,auxdr,pos,x,p,y,j,a,b,c,d,z,xaux,yaux;
    fin>>n>>m>>p;
    for(i=2; i<=n; ++i)
    {
        fin>>x>>y;
        v[x].push_back(i);
        anc[0][i]=x;
        rmq[0][i]=y;
    }
    dfs(1,0);
    for(i=1; i<16; ++i)
    {
        for(j=1; j<=n; ++j)
        {
            anc[i][j]=anc[i-1][anc[i-1][j]];
            rmq[i][j]=min(rmq[i-1][j],rmq[i-1][anc[i-1][j]]);
        }
    }
    fin>>x>>y>>a>>b>>c>>d;
    for(i=1; i<=m; ++i)
    {
        z=solve(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;
}