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

using namespace std;

int main() {
    int n, m, q;
    cin >> n >> m >> q;

    vector<int> digits(n+1);
    vector<vector<string>> paths(n+1, vector<string>(n+1));
    vector<vector<int>> con(n+1);

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

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

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

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

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

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

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

        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];

        int res = 0;
        int l = path.size();
        long long factor = 1;
        for (int j = l-1; j >= 0; j--) {
            int curr = digits[path[j]-'0'];
            res = (res + (curr % m) * (factor % m)) % m;
            factor = (factor * 10) % 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
*/