COLOUR

#define task "COLOUR"
#include <iostream>
#include <cstdio>
#include <vector>

using namespace std;

using ll = long long;
using ld = long double;

constexpr int N = 2e5 + 5;
constexpr int mod = 1e9 + 7;
int n, m, q;

int ranks[N], par[N][18];
vector<int> adj[N];
ll Pow[N], f[N][2];

void Read()
{
    cin >> n >> m >> q;

    for (int i = 1; i < n; ++i)
    {
        int u, v;
        cin >> u >> v;

        adj[u].emplace_back(v);
        adj[v].emplace_back(u);
    }
}

void dfs(int v)
{
    for (int i = 1; i < 18; ++i)
        par[v][i] = par[par[v][i - 1]][i - 1];

    for (auto i : adj[v])
        if (!ranks[i])
        {
            ranks[i] = ranks[v] + 1;
            par[i][0] = v;

            dfs(i);
        }
}

int LCA(int u, int v)
{
    if (ranks[u] < ranks[v])
        swap(u, v);

    for (int i = 17; ~i; --i)
        if (ranks[par[u][i]] >= ranks[v])
            u = par[u][i];
    for (int i = 17; ~i; --i)
        if (par[u][i] != par[v][i])
        {
            u = par[u][i];
            v = par[v][i];
        }

    return u == v ? u : par[u][0];
}

int d(int u, int v)
{
    return ranks[u] + ranks[v] - ranks[LCA(u, v)] * 2;
}

void Solve()
{
    ranks[1] = 1;
    dfs(1);

    Pow[0] = 1;
    f[1][1] = m;

    for (int i = 1; i <= n; ++i)
    {
        Pow[i] = Pow[i - 1] * (m - 1) % mod;
        if (i > 1)
        {
            f[i][0] = (f[i - 1][1] * (m - 1) + f[i - 1][0] * (m - 2)) % mod;
            f[i][1] = f[i - 1][0];
        }
    }

    while (q--)
    {
        int u, v;
        cin >> u >> v;

        int dis = d(u, v) + 1;

        cout << f[dis][0] * Pow[n - dis] % mod << "\n";
    }
}

int32_t main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);

    if (fopen(task ".INP", "r"))
    {
        freopen(task ".INP", "r", stdin);
        freopen(task ".OUT", "w", stdout);
    }

    Read();
    Solve();
}

/*
5 2 3
1 2
3 4
1 4
2 5
2 3
4 5
5 3
*/