//@formatter:off
#include<bits/stdc++.h>
#define overload4(_1,_2,_3,_4,name,...) name
#define rep1(i,n) for (ll i = 0; i < ll(n); ++i)
#define rep2(i,s,n) for (ll i = ll(s); i < ll(n); ++i)
#define rep3(i,s,n,d) for(ll i = ll(s); i < ll(n); i+=d)
#define rep(...) overload4(__VA_ARGS__,rep3,rep2,rep1)(__VA_ARGS__)
#define rrep(i,n) for (ll i = ll(n)-1; i >= 0; i--)
#define all(a) a.begin(),a.end()
#define rall(a) a.rbegin(),a.rend()
#define pb push_back
#define eb emplace_back
#define vi vector<int>
#define vvi vector<vector<int>>
#define vl vector<ll>
#define vvl vector<vector<ll>>
#define vd vector<double>
#define vvd vector<vector<double>>
#define vs vector<string>
#define vc vector<char>
#define vvc vector<vector<char>>
#define vb vector<bool>
#define vvb vector<vector<bool>>
#define vp vector<P>
#define vvp vector<vector<P>>
#ifdef __LOCAL
#define debug(...) { cout << #__VA_ARGS__; cout << ": "; print(__VA_ARGS__); }
#else
#define debug(...) void(0)
#endif
#define INT(...) int __VA_ARGS__;scan(__VA_ARGS__)
#define LL(...) ll __VA_ARGS__;scan(__VA_ARGS__)
#define STR(...) string __VA_ARGS__;scan(__VA_ARGS__)
#define CHR(...) char __VA_ARGS__;scan(__VA_ARGS__)
#define DBL(...) double __VA_ARGS__;scan(__VA_ARGS__)
#define LD(...) ld __VA_ARGS__;scan(__VA_ARGS__)
using namespace std;
using ll = long long;
using P = pair<int,int>;
using LP = pair<ll,ll>;
template<class S,class T> istream& operator>>(istream &is,pair<S,T> &p) { return is >> p.first >> p.second; }
template<class S,class T> ostream& operator<<(ostream &os,const pair<S,T> &p) { return os<<'{'<<p.first<<","<<p.second<<'}'; }
template<class T> istream& operator>>(istream &is,vector<T> &v) { for(T &t:v){is>>t;} return is; }
template<class T> ostream& operator<<(ostream &os,const vector<T> &v) { os<<'[';rep(i,v.size())os<<v[i]<<(i==int(v.size()-1)?"":","); return os<<']'; }
void Yes(bool b) { cout << (b ? "Yes" : "No") << '\n'; }
void YES(bool b) { cout << (b ? "YES" : "NO") << '\n'; }
template<class T> void fin(T a) { cout << a << '\n'; exit(0); }
template<class T> bool chmin(T& a,T b) {if(a > b){a = b; return true;} return false;}
template<class T> bool chmax(T& a,T b) {if(a < b){a = b; return true;} return false;}
void scan(){}
template <class Head, class... Tail> void scan(Head& head, Tail&... tail){ cin >> head; scan(tail...); }
template<class T> void print(const T& t){ cout << t << '\n'; }
template <class Head, class... Tail> void print(const Head& head, const Tail&... tail){ cout<<head<<' '; print(tail...); }
const int inf = 1001001001;
const ll linf = 1001001001001001001;
//@formatter:on

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);
    INT(n, m);
    vvp G(n);
    vi a(m), b(m);
    rep(i, m) {
        scan(a[i], b[i]);
        a[i]--;
        b[i]--;
    }
    vi c(n);
    cin >> c;
    vi ans(m, -1);
    int cnt = 0;
    auto direct = [&](int id, int from, int to) {
        if (a[id] == from) ans[id] = 0;
        else ans[id] = 1;
    };
    rep(i, m) {
        if (c[a[i]] > c[b[i]]) direct(i, a[i], b[i]);
        else if (c[a[i]] < c[b[i]]) direct(i, b[i], a[i]);
        else {
            G[a[i]].eb(b[i], i);
            G[b[i]].eb(a[i], i);
            cnt++;
        }
    }
    vb seen(n);
    auto dfs = [&](auto &self, int u, int p) -> void {
        seen[u] = true;
        for (auto[v, id] : G[u]) {
            if (v == p) continue;
            if (ans[id] < 0) direct(id, u, v);
            if (!seen[v]) {
                self(self, v, u);
            }
        }
    };
    rep(i, n) {
        if (seen[i]) continue;
        dfs(dfs, i, -1);
    }
    rep(i, m) {
        assert(ans[i] >= 0);
        cout << (ans[i] ? "<-" : "->") << endl;
    }
}
#include<bits/stdc++.h>
using namespace std;

long long n,m,a[5005],b[5005],c[5005];
vector<int> grafo[105];
map<pair<int,int>,bool> f;
bool vis[101];

void dfs(int nodo){
	if(vis[nodo])return;
	vis[nodo]=true;
	
	for(auto i : grafo[nodo]){
		if(c[i]<c[nodo] || (c[i]==c[nodo] && f[{i,nodo}]==false && f[{nodo,i}]==false)){
			f[{nodo,i}]=true;
			dfs(i);
		}
	}
}

int main(){

	ios::sync_with_stdio(false);
	cin.tie(0);

	cin>>n>>m;
	
	for(int i=0;i<m;i++){
		cin>>a[i]>>b[i];
		grafo[a[i]].push_back(b[i]);
		grafo[b[i]].push_back(a[i]);
	}
	
	for(int i=1;i<=n;i++)cin>>c[i];
	
	for(int i=1;i<=n;i++){
		dfs(i);
	}
	
	for(int i=0;i<m;i++){
		if(f[{a[i],b[i]}])cout<<"->";
		else cout<<"<-";
		cout<<"\n";
	}

	return 0;
}
