#include <iostream>
#include <vector>
#include <cstdio>

using namespace std;

const int INF = 1e9;

int main() {
    //freopen("input.txt", "r", stdin);
    int n, k;
    cin >> n >> k;
    vector<vector<int>> sv(n + 1);
    vector<pair<vector<int>, vector<int>>> a(n + 1);
    for (int l = 1; l <= n; ++l) {
        vector<int> p(k), q(k);
        for (int i = 0; i < k; ++i) {
            cin >> p[i];
        }
        for (int i = 0; i < k; ++i) {
            cin >> q[i];
        }
        a[l].first = p;
        a[l].second = q;
    }
    for (int i = 0; i < n - 1; ++i) {
        int x, y;
        cin >> x >> y;
        sv[x].push_back(y);
        sv[y].push_back(x);
    }
    vector<vector<int>> f(n + 1, vector<int> (n + 1, -1));
    for (int i = 1; i <= n; ++i) {
        for (int l = 1; l <= n; ++l) {
            if (i == l) {
                f[i][l] = 0;
                continue;
            }
            bool o = true;
            for (int q = 0; q < k; ++q) {
                if (!(a[i].first[q] >= a[l].first[q] && a[i].first[q] <= a[l].second[q] ||
                    a[i].second[q] >= a[l].first[q] && a[i].second[q] <= a[l].second[q] ||
                        a[l].first[q] >= a[i].first[q] && a[l].first[q] <= a[i].second[q] ||
                        a[l].second[q] >= a[i].first[q] && a[l].second[q] <= a[i].second[q])) {
                    f[i][l] = 1;
                }
            }
        }
    }
    vector<vector<int>> flo(n + 1, vector<int> (n + 1, INF));
    for (int i = 1; i <= n; ++i) {
        flo[i][i] = 0;
        for (auto next : sv[i]) {
            flo[i][next] = 1;
        }
    }
    for (int i = 1; i <= n; ++i) {
        for (int l = 1; l <= n; ++l) {
            for (int j = 1; j <= n; ++j) {
                flo[i][l] = min(flo[i][l], flo[i][j] + flo[j][l]);
            }
        }
    }
    int mi = INF;
    for (int i = 1; i <= n; ++i) {
        for (int l = 1; l <= n; ++l) {
            if (f[i][l] == 1) {
                mi = min(mi, flo[i][l]);
            }
        }
    }
    if (mi == INF) {
        cout << -1;
    } else {
        cout << mi;
    }/*
    cout << "\n";
    for (int i = 1; i <= n; ++i) {
        for (int l = 1; l <= n; ++l) {
            cout << f[i][l] << " ";
        }
        cout << "\n";
    }
    cout << "\n";
    for (int i = 1; i <= n; ++i) {
        for (int l = 1; l <= n; ++l) {
            cout << flo[i][l] << " ";
        }
        cout << "\n";
    }*/
    return 0;
}