2 3
1 2 1 3
1 2 1 3 2 3
 3 7
8 2 7 9 8 1
3 1 8 1 2 7 4 7 4 2 1 4 4 6
 1 10
3 9
3 2 3 4 5 3 5 7 8 6 2 5 7 8 2 4 1 7 5 1
 12 1
6 2 6 4 8 6 6 9 5 6 6 1 9 1 1 3 3 9 2 4 5 2 8 1
6 7
 2 3
1 2 7 8
1 3 2 4 7 9
 3 2
1 2 1 3 2 3
1 2 4 5
 3 8
8 9 8 5 9 2
8 4 8 3 2 6 4 2 4 3 3 7 3 6 1 6
 8 5
7 9 6 7 4 7 2 1 4 9 2 9 4 2 9 6
8 7 1 8 8 5 3 5 3 8
 4 4
1 2 1 3 6 7 6 8
1 4 1 5 6 1 6 9
 3 10
6 1 4 1 4 6
7 1 8 1 8 5 3 2 9 7 9 3 5 9 5 3 5 7 7 2
 3 3
1 2 1 3 2 3
1 2 1 3 2 3
 11 1
2 6 1 4 7 9 7 6 8 1 4 8 4 7 7 2 1 7 9 6 6 5
3 1
 5 6
1 7 5 6 6 9 3 6 1 9
2 7 2 5 8 5 4 8 4 2 8 2
 8 1
1 6 7 6 7 3 9 2 1 2 8 6 2 3 4 1
8 3
 9 4
2 8 8 9 8 1 9 2 5 9 3 5 3 2 5 2 9 1
8 4 8 7 6 8 4 7
 4 7
9 2 4 1 2 3 2 7
6 1 5 4 7 5 6 3 1 5 8 1 1 4
 3 3
1 2 5 6 7 8
2 3 4 5 8 9
 1 7
8 4
9 8 8 2 6 8 8 1 7 8 2 1 9 5
 2 2
1 2 2 3
2 3 3 4
 12 12
6 7 5 4 7 8 2 9 8 5 3 5 1 6 7 3 7 9 5 7 1 8 6 8
6 4 2 1 7 8 1 6 8 5 9 8 1 5 7 2 5 9 6 3 9 2 9 4
 9 1
3 4 3 2 3 7 3 5 9 4 1 9 6 4 5 2 7 6
8 3
 9 2
9 6 1 6 2 5 7 3 8 1 7 2 9 1 2 8 3 8
6 4 4 5
 3 9
9 7 9 2 7 2
9 8 1 9 3 9 6 3 8 6 4 6 1 3 5 4 5 3
 3 6
3 5 7 4 7 5
3 9 3 2 8 6 6 2 8 2 6 9
 2 1
1 2 1 3
1 2
 9 1
1 8 7 6 7 2 7 9 4 1 4 3 3 8 4 6 9 6
9 4
 2 2
1 2 2 4
1 2 1 3
 6 9
8 1 8 4 2 8 2 1 4 1 4 2
8 3 8 6 7 8 5 8 6 7 5 7 9 6 5 6 5 3
 12 2
3 1 8 2 6 9 2 6 5 4 4 3 4 1 4 2 6 3 9 7 9 4 3 2
7 1 4 1
 2 1
4 5 6 7
4 7
 4 3
1 2 4 5 6 7 8 9
1 2 8 9 3 1
 12 12
7 6 3 8 8 4 4 7 1 9 9 5 7 5 4 9 8 6 2 7 7 3 3 6
9 1 2 4 9 8 5 3 6 7 3 8 2 7 5 9 6 4 3 1 2 6 1 4
 12 5
9 2 6 7 7 8 3 4 8 4 7 1 2 1 7 3 7 2 5 6 3 8 1 5
3 7 7 5 7 4 5 8 4 6
 7 6
6 2 9 2 6 5 2 4 1 2 4 5 6 7
3 9 5 1 9 8 9 5 3 4 2 3
 6 4
2 7 3 2 8 3 1 5 7 4 3 5
2 6 9 8 8 6 6 9
 10 2
4 9 2 1 5 1 6 2 6 7 2 7 5 8 1 7 5 3 9 1
9 7 1 4
 4 4
1 2 2 3 1 3 4 5
1 3 3 2 1 2 4 6
 3 4
2 1 8 9 3 1
1 2 4 5 6 7 8 9
 1 12
6 8
8 4 8 2 5 8 9 8 8 3 8 7 8 1 1 3 1 9 4 3 7 3 5 7
 4 4
1 2 3 4 5 6 7 8
2 3 4 5 6 7 8 1
 3 10
1 5 7 1 2 1
9 5 5 6 3 5 4 7 8 3 9 6 8 4 9 8 4 6 3 4
 3 2
1 2 4 5 6 7
4 7 1 3
 5 6
4 7 7 3 4 3 9 4 3 9
7 5 7 8 1 7 7 2 6 2 1 2
 7 3
2 6 6 7 6 4 6 1 9 6 7 4 1 9
6 5 3 6 6 8
 2 7
2 7 2 5
7 1 9 7 8 9 4 9 8 1 3 9 3 8
 2 2
1 2 1 3
1 2 1 3
 2 11
6 1 3 6
1 7 1 2 1 5 1 4 5 3 3 2 9 8 4 2 7 5 4 9 2 9
 12 12
1 6 2 6 8 3 6 4 4 8 7 2 7 5 9 4 2 4 9 5 8 5 3 6
2 8 6 9 2 6 7 4 6 5 6 3 5 8 7 8 7 1 1 9 9 7 7 3
 4 12
2 8 3 1 2 1 9 4
9 5 5 3 1 6 3 7 7 1 8 5 6 5 4 6 1 9 1 4 2 5 9 8

-1 -1 3 6 -1 -1 0 0 -1 1 -1 1 0 -1 8 -1 0 8 0 -1 3 0 9 3 1 -1 0 8 -1 -1 1 -1 -1 -1 0 -1 -1 1 8 -1 0 -1 7 6 7 1 0 -1 -1
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define pb push_back
#define mp make_pair
#define all(a) begin(a),end(a)
#define FOR(x,val,to) for(int x=(val);x<int((to));++x)
#define FORE(x,val,to) for(auto x=(val);x<=(to);++x)
#define FORR(x,arr) for(auto &x: arr)
#define FORS(x,plus,arr) for(auto x = begin(arr)+(plus); x != end(arr); ++x)
#define FORREV(x,plus,arr) for(auto x = (arr).rbegin()+(plus); x !=(arr).rend(); ++x)
#define REE(s_) {cout<<s_<<'\n';exit(0);}
#define GET(arr) for(auto &i: (arr)) sc(i)
#define whatis(x) cerr << #x << " is " << x << endl;
#define e1 first
#define e2 second
#define INF 0x7f7f7f7f
typedef std::pair<int,int> pi;
typedef std::vector<int> vi;
typedef std::vector<std::string> vs;
typedef int64_t ll;
typedef uint64_t ull;
#define umap unordered_map
#define uset unordered_set
using namespace std;
using namespace __gnu_pbds;

#ifdef _WIN32
#define getchar_unlocked() _getchar_nolock()
#define _CRT_DISABLE_PERFCRIT_LOCKS
#endif
template<class T> ostream& operator<<(ostream &os, vector<T> V) { os<<"[";for(auto const &vv:V)os<<vv<<","; os<<"]"; return os; }
template<class L, class R> ostream& operator<<(ostream &os, pair<L, R> P) { os<<"("<<P.first<<","<<P.second<<")"; return os; }
inline int fstoi(const string &str){auto it=str.begin();bool neg=0;int num=0;if(*it=='-')neg=1;else num=*it-'0';++it;while(it<str.end()) num=num*10+(*it++-'0');if(neg)num*=-1;return num;}
inline void getch(char &x){while(x = getchar_unlocked(), x < 33){;}}
inline void getstr(string &str){str.clear(); char cur;while(cur=getchar_unlocked(),cur<33){;}while(cur>32){str+=cur;cur=getchar_unlocked();}}
template<typename T> inline bool sc(T &num){ bool neg=0; int c; num=0; while(c=getchar_unlocked(),c<33){if(c == EOF) return false;} if(c=='-'){ neg=1; c=getchar_unlocked(); } for(;c>47;c=getchar_unlocked()) num=num*10+c-48; if(neg) num*=-1; return true;}template<typename T, typename ...Args> inline void sc(T &num, Args &...args){ bool neg=0; int c; num=0; while(c=getchar_unlocked(),c<33){;} if(c=='-'){ neg=1; c=getchar_unlocked(); } for(;c>47;c=getchar_unlocked()) num=num*10+c-48; if(neg) num*=-1; sc(args...); }
template<typename T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>; //s.find_by_order(), s.order_of_key() <- works like lower_bound
template<typename T> using ordered_map = tree<T, int, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
#define N 1000000007

int main(){
    ios_base::sync_with_stdio(0);cin.tie(0);
    int n,m;
    sc(n,m);
    pi a[n];
    pi b[m];
    FOR(i,0,n){
        sc(a[i].e1,a[i].e2);
        if(a[i].e2 < a[i].e1) swap(a[i].e1,a[i].e2);
    }
    FOR(i,0,m){
        sc(b[i].e1,b[i].e2);
        if(b[i].e2 < b[i].e1) swap(b[i].e1,b[i].e2);
    }
    int cnn = 0;
    int wh = 0;
    int sthh = 0;
    static int c[10];
    FOR(i,0,n){
        int cn = 0;
        bool ff = 0;
        bool ss = 0;
        FOR(x,0,m){
            if(a[i].e1 == b[x].e1 && a[i].e2 == b[x].e2) continue;
            if(a[i].e1 == b[x].e1 || a[i].e2 == b[x].e2 || a[i].e1 == b[x].e2 || a[i].e2 == b[x].e1){
                ++cnn;
                ++cn;
                if(a[i].e1 == b[x].e1) ++c[a[i].e1],ff=1;
                if(a[i].e2 == b[x].e1) ++c[a[i].e2],ss=1;
                if(a[i].e1 == b[x].e2) ++c[a[i].e1],ff=1;
                if(a[i].e2 == b[x].e2) ++c[a[i].e2],ss=1;
            }
        }
        if(ff&&ss) sthh |= 1;
    }
    int cis = 0;
    FOR(i,0,10) cis += c[i] != 0;
    FOR(i,0,10) if(c[i]) wh = i;
    if(cis == 1) cout << wh;
    else if(!sthh) cout << 0;
    else cout << -1;
}

