#include <vector>
#include <stack>
#include <queue>
#include <list>
#include <bitset>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <algorithm>
#include <numeric>
#include <iostream>
#include <iomanip>
#include <string>
#include <chrono>
#include <random>
#include <cmath>
#include <cassert>
#include <climits>
#include <cstring>
#include <cstdlib>
#include <functional>
#include <sstream>

using namespace std;


class DisjointSet {
    public:
        DisjointSet(int n) : N(n), sz(n), pars(n, -1) {
        }
        void reset() { sz = N, fill(pars.begin(), pars.end(), -1); }
        int find(int x) { return pars[x] < 0 ? x : pars[x] = find(pars[x]); }
        int size() { return sz; }
        int count(int x) { return -pars[find(x)]; }
        bool unite(int x, int y) {
            x = find(x), y = find(y);
            if (x == y) { return false; }
            --sz;
            if (pars[x] < pars[y]) { swap(x, y); }
            pars[y] += pars[x];
            pars[x] = y;
            return true;
        }
        bool isSame(int x, int y) { return find(x) == find(y); }
    private:
        int N, sz;
        vector<int> pars;
};

int main(int argc, char** argv) {
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout << fixed << setprecision(12);

    int n;
    cin >> n;
    int m;
    cin >> m;
    vector<int> A(m);
    vector<int> B(m);
    for (int i = 0; i < m; ++i) {
        cin >> A[i] >> B[i];
        --A[i], --B[i];
    }
    vector<int> C(n);
    for (int i = 0; i < n; ++i) {
        cin >> C[i];
    }


    auto cmp = [&](int l, int r) {
        return C[l] < C[r];
    };

    vector<int> ord(n, 0);
    iota(ord.begin(), ord.end(), 0);
    sort(ord.begin(), ord.end(), cmp);


    DisjointSet ds(n);

    vector<vector<bool>> E(n, vector<bool>(n, false));
    for (int i = 0; i < m; ++i) {
        int u = A[i], v = B[i];
        E[u][v] = E[v][u] = true;
        if (C[u] == C[v]) {
            ds.unite(u, v);        
        }
    }

    vector<int> dirs(m, 0);

    for (int i = 0; i < m; ++i) {
        int u = A[i], v = B[i];
        if (C[u] != C[v]) {
            dirs[i] = C[u] < C[v];
        }
    }

    map<pair<int,int>, int> M;
    for (int i = 0; i < m; ++i) {
        M.emplace(make_pair(A[i], B[i]), i);
    }


    vector<bool> visited(n, false);

    function<void(int,int,int)> dfs = [&](int u, int p, int s) {
        visited[u] = true;
        for (int v = 0; v < n; ++v) {
            if (v == p) {
                continue;
            }
            if (E[u][v] && ds.find(v) == s) {
                auto it = M.find(make_pair(u, v));
                int ans = 0;
                int idx = -1;
                if (it == M.end()) {
                    it = M.find(make_pair(v, u));
                    if (it != M.end()) {
                        ans = 1;
                        idx = it->second;
                        M.erase(it);
                    }
                } else {
                    idx = it->second;
                    M.erase(it);
                }
                // cout << u << "," << v << " : " << idx << " " << ans << endl;
                if (idx >= 0) {
                    dirs[idx] = ans;
                }

                if (!visited[v]) {
                    dfs(v, u, s);
                }
            }
        }
    };
    for (int i = 0; i < n; ++i) {
        if (ds.count(i) > 1 && ds.find(i) == i) {
            dfs(i, -1, i);
        }
    }


    vector<string> DIRS{"->", "<-"};
    for (int i = 0; i < m; ++i) {
        cout << DIRS[dirs[i]] << '\n';
    }



    return 0;
}
//@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;
    }
}