3
1 1 5
1 3 42
1 2 42
 2
42 23
1 2 10
 10
45792697 27183921 4791060 77070594 27286110 66957065 19283638 2944837 26775511 65379701
5 8 25
8 10 94
1 4 14
9 7 96
4 2 16
2 6 58
2 3 99
6 8 21
8 9 87
 5
3 1 2 6 5
1 2 3
2 3 1
4 3 9
5 3 1
 10
26 31 21 57 56 44 54 58 79 97
2 1 277
1 8 91
1 7 380
4 1 649
10 5 799
10 1 940
8 6 627
6 3 177
9 6 685
 10
8 100 62 38 26 51 26 23 77 32
6 8 29
4 1 82
7 8 66
7 10 67
8 9 98
6 1 14
1 5 48
3 1 58
2 9 90
 2
23 42
1 2 10
 1
42
 3
1 5 1
1 3 42
1 2 42
 10
1 1 1 1 1 1 1 1 1 1
1 2 5
1 3 5
1 4 5
1 5 5
1 6 5
1 7 5
1 8 5
1 9 5
1 10 5
 3
1 1 1
1 2 42
2 3 42
 3
5 1 1
1 3 42
1 2 24

3 1042.0638260857 1 727.3238618387 6 283959805416.40496826
 3 192.0000000000 1 13952642.4776933547 8 544327.1927847408 2 727.3238618387 1 0.0000000000 2 1042.0638260857 1 100.6230589875 2 544.3822186663 1 389.7666169867
#include <bits/stdc++.h>
using namespace std;
template <class T>
void debug(T a, T b) {
  ;
}
template <class T>
void chmin(T& a, const T& b) {
  if (a > b) a = b;
}
template <class T>
void chmax(T& a, const T& b) {
  if (a < b) a = b;
}
namespace std {
template <class S, class T>
ostream& operator<<(ostream& out, const pair<S, T>& a) {
  out << '(' << a.first << ',' << a.second << ')';
  return out;
}
}  // namespace std
long long int readL() {
  long long int res;
  scanf("%I64d", &res);
  return res;
}
void printL(long long int res) { printf("%I64d", res); }
const int INF = 5e8;
int n;
int w[200005];
static const int MAX_N = 200005;
vector<pair<int, int> > g[MAX_N];
int cut[MAX_N], size[MAX_N], whole;
int root, rcost;
int getsize(int v, int p) {
  size[v] = 1;
  for (int i = 0; i < (g[v].size()); ++i) {
    int to = g[v][i].first;
    if (to != p && cut[to] == 0) size[v] += getsize(to, v);
  }
  return size[v];
}
void getbestroot(int v, int p) {
  int maxi = 0;
  for (int i = 0; i < (g[v].size()); ++i) {
    int to = g[v][i].first;
    if (to != p && cut[to] == 0) {
      getbestroot(to, v);
      maxi = max(maxi, size[to]);
    }
  }
  int rest = whole - size[v];
  maxi = max(maxi, rest);
  if (maxi < rcost) {
    rcost = maxi;
    root = v;
  }
}
vector<int> cand;
int cnt;
int ways[MAX_N];
double dfs2(int v, int p, int d) {
  double res = w[v] * sqrt((double)d);
  for (auto e : g[v]) {
    if (e.first == p) continue;
    res += dfs2(e.first, v, d + e.second);
  }
  return res;
}
void dfs(int v) {
  getsize(v, -1);
  if (size[v] == 1) {
    cand.push_back(v);
    return;
  }
  whole = size[v];
  rcost = INF;
  getbestroot(v, -1);
  v = root;
  cand.push_back(root);
  cut[v] = 1;
  double mx = -1;
  int nxt = -1;
  for (int i = 0; i < (g[v].size()); ++i) {
    pair<int, int>& e = g[v][i];
    if (cut[e.first] == 0) {
      double a = dfs2(e.first, v, e.second);
      if (mx < a) {
        mx = a;
        nxt = e.first;
      }
    }
  }
  if (~nxt) dfs(nxt);
  cut[v] = 0;
}
double calc(int v, int p, int d) {
  double res = w[v] * sqrt((double)d) * d;
  for (auto e : g[v]) {
    if (e.first == p) continue;
    res += calc(e.first, v, d + e.second);
  }
  return res;
}
int main() {
  cin >> n;
  for (int i = 0; i < (n); ++i) scanf("%d", &w[i]);
  for (int i = 0; i < (n - 1); ++i) {
    int a, b, l;
    scanf("%d%d%d", &a, &b, &l);
    --a;
    --b;
    g[a].push_back(make_pair(b, l));
    g[b].push_back(make_pair(a, l));
  }
  dfs(0);
  double res = 1e100;
  int R;
  for (auto v : cand) {
    double t = calc(v, -1, 0);
    if (res > t) {
      res = t;
      R = v;
    }
  }
  printf("%d %.10f\n", R + 1, res);
  return 0;
}
