#include<fstream>
#include<vector>

using namespace std;

ifstream fi("atac.in");
ofstream fo("atac.out");

int T[32005][20],Val[32005][20],Niv[32005];
vector<pair<int,int> > A[32005];

int get_min(int x, int y)
{
    if(x==y)
        return 0;

    int rez=1000000000;

    if(Niv[x]>Niv[y])
        swap(x,y);

    for(int i=14; i>=0; i--)
    {
        if(Niv[T[y][i]]>=Niv[x])
        {
            rez=min(rez,Val[y][i]);
            y=T[y][i];
        }
    }
    if(x==y)
        return rez;
    for(int i=14; i>=0; i--)
    {
        if(T[x][i]!=T[y][i])
        {
            rez=min(rez,Val[x][i]);
            rez=min(rez,Val[y][i]);
            x=T[x][i];
            y=T[y][i];
        }
    }
    return min(rez,min(Val[x][0],Val[y][0]));
}

void dfs(int nod, int p)
{
    Niv[nod]=1+Niv[p];
    T[nod][0]=p;

    for(vector<pair<int,int> >::iterator it=A[nod].begin(); it!=A[nod].end(); it++)
    {
        if((*it).first==p)
            continue;
        dfs((*it).first,nod);
        Val[(*it).first][0]=(*it).second;
    }
}

int main()
{
    int n,m,p;
    fi>>n>>m>>p;

    for(int i=2; i<=n; i++)
    {
        int x,y;
        fi>>x>>y;
        A[i].push_back({x,y});
        A[x].push_back({i,y});
    }

    dfs(1,0);
    for(int i=1; i<=14; i++)
    {
        for(int j=1; j<=n; j++)
        {
            T[j][i]=T[T[j][i-1]][i-1];
            Val[j][i]=min(Val[j][i-1],Val[T[j][i-1]][i-1]);
        }
    }

    int x,y,a,b,c,d;
    fi>>x>>y>>a>>b>>c>>d;

    for(int i=1; i<=m; i++)
    {
        int rez=get_min(x,y);
        if(m-p+1<=i)
            fo<<rez<<"\n";

        x=(a*x+b*y)%n+1;
        y=(c*y+d*rez)%n+1;
    }
    fi.close();
    fo.close();
    return 0;
}