#include <iostream>
#include <vector>
#include <string>

using namespace std;

int main() {
    int n, m, q;
    cin >> n >> m >> q;
    int digits[n+1];

    string paths[n+1][n+1];
    vector<int> con[n+1];



    for (int i = 0;  i < n-1; i++) {
        int a, b;
        cin >> a >> b;

        for (auto& i : con[a]) {
            if (paths[i][b].empty()) {

                paths[i][b] = paths[i][a];
                paths[i][b] += to_string(b);

                paths[b][i] = to_string(a);
                paths[b][i] += paths[a][i];

                con[i].push_back(b);
                con[b].push_back(i);
            }
        }
        for (auto& i : con[b]) {
            if (paths[i][a].empty()) {

                paths[i][a] = paths[i][b];
                paths[i][a] += to_string(a);

                paths[a][i] = to_string(b);
                paths[a][i] += paths[b][i];

                con[i].push_back(a);
                con[a].push_back(i);
            }
        }

        paths[a][b] = to_string(b);
        paths[b][a] = to_string(a);

        con[b].push_back(a);
        con[a].push_back(b);
    }

    for (int i = 1; i <= n; i++) {
        paths[i][i] = to_string(i);
    }

    for (int i = 1; i <= n; i++) {
        cin >> digits[i];
    }

    for (int i = 0; i < q; i++) {
        int a, b;
        cin >> a >> b;
        string path = paths[a][b];
        string num = "";
        for (char c : path) {
            num += digits[c-'0']+'0';
        }

        int res = 0;
        int digits = num.size();
        for (int i = 0; i < digits; i++) {
            int curr = num[i]-'0';
            int factor = stoi("1"+string(digits-i-1, '0'));
            res = (res + (curr % m) * (factor % m)) % m;
        }
        cout << res << "\n";
    }
    return 0;
}

/*

simply simulate. problem - how to find the path to a node

need to be able to do it in logn

only one path - how to get that path?

need to have everything in the path  to get the path



problem reduced to finding
*/