#include<bits/stdc++.h>
#define rep(i,a,b) for(int i=(a);i<=(b);++i)
#define per(i,a,b) for(int i=(a);i>=(b);--i)
#define SZ(x) ((int)(x).size())
#define pb push_back
#define eb emplace_back
using namespace std;
const int N=400005,maxN=1000005;
namespace solver{
	int n;
	vector<int>e[N];
	int dfn[N],low[N],idx;
	int st[N],top;
	void init(int n0){
		rep(i,1,n){
			dfn[i]=low[i]=0;
			e[i].clear();
		}
		idx=0;
		top=0;
		n=n0;
	}
	void link(int u,int v){
		e[u].pb(v),e[v].pb(u);
	}
	int flag;
	void tarjan(int u){
		dfn[u]=low[u]=++idx,st[++top]=u;
		for(auto&x:e[u]){
			if(!dfn[x]){
				tarjan(x),low[u]=min(low[u],low[x]);
				if(low[x]>=dfn[u]){
					int cnt_v=0;
					int cnt_e=0;
					do{
						++cnt_v;
						for(auto&x:e[st[top]]){
							if(dfn[x]<dfn[st[top]]){
								++cnt_e;
							}
						}
					}while(st[top--]!=x);
					++cnt_v;
					if(cnt_v%2==0||cnt_e>cnt_v){
						flag=1;
					}
				}
			}
			else low[u]=min(low[u],dfn[x]);
		}
		
	}
	bool solve(){
		flag=0;
		rep(i,1,n)if(!dfn[i])tarjan(i);
		return flag;
	}
}
struct fenwick{
	int tr[maxN];
	void add(int x,int y){for(int i=x;i<maxN;i+=i&-i)tr[i]+=y;}
	int query(int x){int y=0;for(int i=x;i;i&=i-1)y+=tr[i];return y;}
}fwk;
int n,m,b0[N],b1[N];
vector<int>e[N];
int dfn[N],low[N],st[N],top,idx;
int seq[N],len,bel[N],cnt;
int rk[N];
void GG(){puts("impossible"),exit(0);}
int calc(const vector<int>&v){
	int ret=0;
	per(i,SZ(v)-1,0){
		ret^=fwk.query(v[i])&1;
		fwk.add(v[i],1);
	}
	rep(i,0,SZ(v)-1){
		fwk.add(v[i],-1);
	}
	return ret;
}
const int B=19260817;
const int P=998244853;
int pw[N];
vector<int>get_h(const vector<int>&v){
	vector<int>h(SZ(v)+1);
	per(i,SZ(v)-1,0){
		h[i]=(1LL*h[i+1]*B+v[i])%P;
	}
	return h;
}
int ghs(vector<int>&h,int l,int r){
	return (h[l]-1LL*h[r+1]*pw[r-l+1]%P+P)%P;
}
void tarjan(int u,int fa){
	dfn[u]=low[u]=++idx,st[++top]=u;
	for(auto&x:e[u])if(x!=fa){
		if(!dfn[x])tarjan(x,u),low[u]=min(low[u],low[x]);
		else low[u]=min(low[u],dfn[x]);
	}
	if(dfn[u]==low[u]){
		++cnt;
		len=0;
		do{
			bel[st[top]]=cnt;
			seq[++len]=st[top];
			rk[st[top]]=len;
		}while(st[top--]!=u);
		solver::init(len);
		int cnt_e=0;
		rep(i,1,len)for(auto&x:e[seq[i]])if(bel[x]==cnt){
			if(x<seq[i]){
				++cnt_e;
				solver::link(rk[x],rk[seq[i]]);
			}
		}
		if(len==1){
			if(b0[seq[1]]!=b1[seq[1]]){
				GG();
			}
		}else{
			vector<int>v1,v2;
			rep(i,1,len){
				v1.pb(b0[seq[i]]);
				v2.pb(b1[seq[i]]);
			}
			if(cnt_e==len){
				auto h1=get_h(v1);
				auto h2=get_h(v2);
				bool same=0;
				rep(i,0,SZ(v1)-1){
					if(ghs(h1,0,i)==ghs(h2,SZ(v2)-1-i,SZ(v2)-1)&&ghs(h1,i+1,SZ(v1)-1)==ghs(h2,0,SZ(v2)-1-i-1)){
						same=1;
						break;
					}
				}
				if(!same)GG();
			}else{
				if(solver::solve()){
					sort(v1.begin(),v1.end());
					sort(v2.begin(),v2.end());
					if(v1!=v2)GG();
				}else{
					if(calc(v1)!=calc(v2)){
						sort(v1.begin(),v1.end());
						sort(v2.begin(),v2.end());
						if(v1!=v2)GG();
						bool flag=0;
						rep(i,1,SZ(v1)-1){
							if(v1[i]==v1[i-1]){
								flag=1;
							}
						}
						if(!flag){
							GG();
						}
					}else{
						sort(v1.begin(),v1.end());
						sort(v2.begin(),v2.end());
						if(v1!=v2)GG();
					}
				}
			}
		}
	}
}
int main(){
#ifdef xay5421
	freopen("a.in","r",stdin);
#endif
	ios::sync_with_stdio(0),cin.tie(0);
	pw[0]=1;
	rep(i,1,N-1)pw[i]=1LL*pw[i-1]*B%P;
	cin>>n>>m;
	rep(i,1,n){
		cin>>b0[i]>>b1[i];
	}
	rep(i,1,m){
		int u,v;
		cin>>u>>v;
		e[u].pb(v);
		e[v].pb(u);
	}
	rep(i,1,n)if(!dfn[i])tarjan(i,0);
	puts("possible");
	return 0;
}