using namespace std;
#include <cstdio>
#include <algorithm>
#include <vector>
#define IN "atac.in"
#define OUT "atac.out"
#define min(x,y) x < y ? x : y
#define FOR(i,a,b) for(int i=a;i<=b;++i)
#define N_MAX 1<<15
#define M_MAX 1<<17
typedef struct nod
{
int x, c;
nod *a;
} *pNod;
pNod v[N_MAX];
int hg[N_MAX];
int CS[N_MAX],tata[N_MAX];
short int stv[M_MAX],poz[N_MAX],lg[M_MAX],rmq[18][M_MAX];
short int TA[18][N_MAX],drum[18][N_MAX];
int best,q,rez,s,f;
int maxhg,Z,X,Y,A,B,C,D,P,N,M;
void add(int x, int y, int c)
{
pNod p;
p = new nod;
p -> x = y;
p -> c = c;
p -> a = v[x];
v[x] = p;
}
void scan()
{
int x,y;
freopen(IN, "r",stdin);
freopen(OUT, "w",stdout);
scanf("%d%d%d\n", &N,&M,&P);
FOR(i,1,N-1)
{
scanf("%d%d\n", &x,&y);
add(i+1,x,y);
add(x,i+1,y);
}
scanf("%d%d%d%d%d%d",&X,&Y,&A,&B,&C,&D);
}
void euler(int nod, int niv)
{
pNod p;
stv[ ++stv[0] ] = nod;
poz[nod] = stv[0];
hg[nod] = niv;
maxhg = max(maxhg,hg[nod]);
for (p = v[nod]; p != NULL; p = p -> a)
if ( !poz[p -> x] )
{
tata[p -> x] = nod;
CS[p -> x] = p -> c;
euler(p -> x, niv + 1);
stv[ ++stv[0] ] = nod;
}
}
void process()
{
--lg[0];
FOR(i,1,stv[0])
lg[i] = lg[i>>1] + 1;
FOR(i,1,stv[0])
rmq[0][i] = stv[i];
for(int i=1; (1<<i) <= stv[0];++i)
for(int j=1;j+(1<<i)-1 <= stv[0];++j)
if(hg[ rmq[i-1][j] ] < hg[ rmq[i-1][ j+(1<<i) - (1<<(i-1))] ])
rmq[i][j] = rmq[i-1][j];
else
rmq[i][j] = rmq[i-1][j+(1<<i) - (1<<(i-1))];
FOR(i,1,N)
TA[0][i] = tata[i],
drum[0][i] = CS[i];
for(int i=1; (1<<i) <= maxhg;++i)
for(int j=1; j <= N ;++j)
{
if(hg[j] < 1<<i )
continue;
TA[i][j] = TA[i-1][ TA[i-1][j] ],
drum[i][j] = min(drum[i-1][j],drum[i-1][ TA[i-1][j] ]);
}
}
int query(int nod1,int nod2)
{
int x = poz[nod1],y = poz[nod2];
if(x > y)
swap(x,y);
int log = lg[y-x+1];
if(hg[ rmq[log][x] ] < hg[ rmq[log][ y-(1<<log) + 1 ] ])
return rmq[log][x];
else
return rmq[log][ y-(1<<log) + 1 ];
}
void query_m(int x,int y)
{
if(hg[y] < hg[x])
{
int log = lg[ hg[x]-hg[y] ];
if(rez > drum[log][x] )
rez = drum[log][x];
query_m(TA[log][x],y);
}
}
void solve()
{
int nod;
FOR(i,1,M)
{
if(X == Y)
rez=0;
else
{
rez = 1<<30;
nod = query(X,Y);
query_m(X,nod);
query_m(Y,nod);
}
if(i > M-P)
printf("%d\n", rez);
Z = rez;
X = (X*A + Y*B) % N + 1;
Y = (Y*C + Z*D) % N + 1;
}
}
int main()
{
scan();
euler(1,1);
process();
solve();
return 0;
}