#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define int ll
#define rep(i,a,b) for (int i = a; i < (b); i++)
#define all(x) begin(x), end(x)
#define sz(x) (int)(x).size()
#define PB push_back
#define FS first
#define SD second
#define ary(k) array<int, k>
template<class A, class B> void cmx(A &x, B y) { x = max<A>(x, y);}
template<class A, class B> void cmn(A &x, B y) { x = min<A>(x, y);}
typedef pair<int, int> pii;
typedef vector<int> vi;
int n,m,t,a[1<<20],p[1<<20],q[1<<20][21],f[1<<20][21],d[1<<20];
vector<int>e[1<<20];
int P(int x,int y){
    int z=1;
    for(;y;y/=2,x=x*x%m)
        if(y&1)
            z=z*x%m;
    return z;
}
void D(int x){
    for(int y:e[x])
        if(y!=f[x][0])
            d[y]=d[x]+1,f[y][0]=x,p[y]=(p[x]*10+a[y])%m,q[y][0]=a[y],D(y);
}
int L(int x,int y){
    if(d[x]<d[y])
        swap(x,y);
    for(int i=20;~i;i--)
        if(d[f[x][i]]>=d[y])
            x=f[x][i];
    if(x==y)
        return x;
    for(int i=20;~i;i--)
        if(f[x][i]!=f[y][i])
            x=f[x][i],y=f[y][i];
    return f[x][0];
}
int W(int x,int y){
    return ((p[y]-p[f[x][0]]*P(10,d[y]-d[x]+1))%m+m)%m;
}
int U(int x,int y){
    int z=0;
    for(int i=20;~i;i--)
        if(d[f[x][i]]>=d[y])
            (z+=q[x][i]*P(10,d[f[x][i]]-d[y]+1)),x=f[x][i];
    return ((z+a[y])%m+m)%m;
}
signed main() {
    cin.tie(0)->sync_with_stdio(0); cin.exceptions(cin.failbit);
    cin>>n>>m>>t;
    for(int i=1,x,y;i<n;i++)
        cin>>x>>y,e[x].push_back(y),e[y].push_back(x);
    for(int i=1;i<=n;i++)
        cin>>a[i],a[i]%=m;
    p[1]=q[1][0]=a[1],d[1]=1,D(1);
    for(int i=1;i<=20;i++)
        for(int j=1;j<=n;j++){
            f[j][i]=f[f[j][i-1]][i-1];
            q[j][i]=q[j][i-1]*P(10,(1<<(i-1)))+q[f[j][i-1]][i-1];
        }
    for(int _=1,x,y;_<=t;_++){
        cin>>x>>y;
        int z=L(x,y);
        if(z==x)
            cout<<W(x,y)<<'\n';
        else if(z==y)
            cout<<U(x,y)<<'\n';
        else
            cout<<((U(x,z)*P(10,d[y]-d[z])+W(z,y)-a[z]*P(10,d[y]-d[z]))%m+m)%m<<'\n';
    }
}