#include <bits/stdc++.h>

using namespace std;

const int N = 1005, P = 998244353;

int f(int x) {
    int res = 1;
    for (int i = 1; i <= x - 2; ++i) res = 1ll * res * x % P;
    return res;
}

vector<int> G[N];
int res = 1;

void dfs(int x, int y, int st, int len) {
    if (G[x].size() != 2) {
        if (st > x) res = 1ll * res * f(len) % P;
    } else {
        for (auto v : G[x]) {
            if (v != y) dfs(v, x, st, len + 1);
        }
    }
}

signed main() {
    int ty, k, n; scanf("%d%d%d", &ty, &k, &n);
    for (int i = 1, x, y; i < n; ++i) {
        scanf("%d%d", &x, &y), G[x].push_back(y), G[y].push_back(x);
    }
    for (int i = 1; i <= n; ++i) {
        for (auto v : G[i]) {
            if (G[i].size() != 2) dfs(v, i, i, 2);
        }
    }
    printf("%d\n", res);
    return 0;
}